| dc.contributor.author | Currie, James D. | |
| dc.contributor.author | Rampersad, Narad | |
| dc.date.accessioned | 2018-01-15T19:56:34Z | |
| dc.date.available | 2018-01-15T19:56:34Z | |
| dc.date.issued | 2008-08-31 | |
| dc.identifier.citation | Currie, James D., and Narad Rampersad. “For each a > 2 there is an Infinite Binary Word with Critical Exponent a.” Electronic Journal of Combinatorics 15(1) (2008): Note #N34. | en_US |
| dc.identifier.issn | 1077-8926 | |
| dc.identifier.uri | http://hdl.handle.net/10680/1343 | |
| dc.description.abstract | The critical exponent of an infinite word w is the supremum of all rational numbers α such that w contains an α-power. We resolve an open question of Krieger and Shallit by showing that for each α>2 there is an infinite binary word with critical exponent α. | en_US |
| dc.description.uri | http://www.combinatorics.org/Volume_15/Abstracts/v15i1n34.html | |
| dc.language.iso | en | en_US |
| dc.publisher | The Electronic Journal of Combinatorics | en_US |
| dc.rights | info:eu-repo/semantics/openAccess | |
| dc.subject | Combinatorics on words | en_US |
| dc.subject | repetitions | |
| dc.subject | critical exponent | |
| dc.title | For each a > 2 there is an Infinite Binary Word with Critical Exponent a | en_US |
| dc.type | Article | en_US |
