| dc.contributor.author | Allouche, Jean-Paul | |
| dc.contributor.author | Currie, James D. | |
| dc.contributor.author | Shallit, Jeffrey | |
| dc.date.accessioned | 2018-01-15T20:29:54Z | |
| dc.date.available | 2018-01-15T20:29:54Z | |
| dc.date.issued | 1998-05-03 | |
| dc.identifier.citation | Allouche, Jean-Paul, James D. Currie, and Jeffrey Shallit. “Extremal Infinite Overlap-Free Binary Words.” Electronic Journal of Combinatorics 5 (1998), http://www.combinatorics.org/Volume_5/Abstracts/v5i1r27.html | en_US |
| dc.identifier.issn | 1077-8926 | |
| dc.identifier.uri | http://hdl.handle.net/10680/1348 | |
| dc.description.abstract | Let t be the infinite fixed point, starting with 1, of the morphism μ:0→01, 1→10. An infinite word over {0,1} is said to be overlap-free if it contains no factor of the form axaxa, where a∈{0,1} and x∈{0,1}∗. We prove that the lexicographically least infinite overlap-free binary word beginning with any specified prefix, if it exists, has a suffix which is a suffix of t In particular, the lexicographically least infinite overlap-free binary word is 001001t. | en_US |
| dc.description.uri | http://www.combinatorics.org/Volume_5/Abstracts/v5i1r27.html | |
| dc.language.iso | en | en_US |
| dc.publisher | The Electronic Journal of Combinatorics | en_US |
| dc.rights | info:eu-repo/semantics/openAccess | |
| dc.title | Extremal Infinite Overlap-Free Binary Words | en_US |
| dc.type | Article | en_US |
