For each $α$ > 2 there is an infinite binary word with critical exponent $α$
| dc.creator | Currie, James D. | |
| dc.creator | Rampersad, Narad | |
| dc.date | 2008-02-27 | |
| dc.date.accessioned | 2026-07-07T13:02:58Z | |
| dc.date.available | 2026-07-07T13:02:58Z | |
| dc.description | For each $α> 2$ there is a binary word with critical exponent $α$. | |
| dc.description | 5 pages | |
| dc.identifier | https://arxiv.org/abs/0802.4095 | |
| dc.identifier | http://arxiv.org/abs/0802.4095 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/226632 | |
| dc.subject | Combinatorics | |
| dc.subject | Formal Languages and Automata Theory | |
| dc.subject | 68R15 | |
| dc.title | For each $α$ > 2 there is an infinite binary word with critical exponent $α$ | |
| dc.type | text |