Abstract
In the past few decades there has been a good deal of papers which are concerned with optimization problems in different areas of mathematics (along 0-1 words, finite or infinite) and which yield - sometimes quite unexpectedly - balanced words as optimal. In this note we list some key results along these lines known to date.
| Original language | English |
|---|---|
| Pages (from-to) | 240-246 |
| Journal | Electronic Proceedings in Theoretical Computer Science |
| Volume | 63 |
| DOIs | |
| Publication status | Published - 2011 |