A ternary square-free sequence avoiding factors equivalent to abcacba
From MaRDI portal
Publication:289989
zbMATH Open1337.05002arXiv1603.03059MaRDI QIDQ289989FDOQ289989
Publication date: 1 June 2016
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Abstract: We solve a problem of Petrova, finalizing the classification of letter patterns avoidable by ternary square-free words; we show that there is a ternary square-free word avoiding letter pattern . In fact, we: (1) characterize all the (two-way) infinite ternary square-free words avoiding letter pattern (2) characterize the lexicographically least (one-way) infinite ternary square-free word avoiding letter pattern (3) show that the number of ternary square-free words of length avoiding letter pattern grows exponentially with .
Full work available at URL: https://arxiv.org/abs/1603.03059
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Uniformly growing k-th power-free homomorphisms
- Extremal infinite overlap-free binary words
- Avoiding letter patterns in ternary square-free words
- Two-Sided Bounds for the Growth Rates of Power-Free Languages
- Aperiodic words on three symbols.
- A Characterization of the Morse Minimal Set
- On ternary square-free circular words
- A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
This page was built for publication: A ternary square-free sequence avoiding factors equivalent to \(abcacba\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q289989)