Transition property for cube-free words
From MaRDI portal
Publication:5918354
DOI10.1007/s00224-020-09979-4OpenAlexW4252110646MaRDI QIDQ5918354
Elena A. Petrova, Arseny M. Shur
Publication date: 3 August 2021
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1812.11119
Related Items (1)
Cites Work
- Unnamed Item
- Deciding context equivalence of binary overlap-free words in linear time
- Polynomial versus exponential growth in repetition-free binary words
- On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters
- On the centers of the set of weakly square-free words on a two letter alphabet
- Overlap-free words and spectra of matrices
- Overlap-free words and finite automata
- The set of \(k\)-power free words over \(\Sigma\) is empty or perfect
- On the structure and extendibility of \(k\)-power free words
- Exact computation of joint spectral characteristics of linear operators
- Subword complexity and power avoidance
- On the tree of binary cube-free words
- CONSTRUCTING PREMAXIMAL BINARY CUBE-FREE WORDS OF ANY LEVEL
- Constructing Premaximal Ternary Square-Free Words of Any Level
- On Two Stronger Versions of Dejean’s Conjecture
- A generator of morphisms for infinite words
- On the Tree of Ternary Square-Free Words
- Two-Sided Bounds for the Growth Rates of Power-Free Languages
- Uniqueness Theorems for Periodic Functions
- Transition property for cube-free words
This page was built for publication: Transition property for cube-free words
