scientific article; zbMATH DE number 3912631
From MaRDI portal
Publication:3689370
Recommendations
- Overlap-free symmetric D0L words
- Symbol Separation in Double Occurrence Words
- Overlapping factors in words
- Overlap-free words and finite automata
- On the context-freeness of the set of words containing overlaps
- OVERLAP-FREE WORDS AND THUE-MORSE SEQUENCES
- scientific article; zbMATH DE number 512830
- Overlap-freeness in infinite partial words
- Overlap-free words and spectra of matrices
- scientific article; zbMATH DE number 3995072
Cited in
(44)- Overlap-freeness in infinite partial words
- Growth rates of power-free languages
- Repetition-free words
- On the length of word chains
- Some combinatorial properties of the Thue-Morse sequence and a problem in semigroups
- Overlap-free words and finite automata
- Periodicity and the golden ratio
- A characterization of overlap-free morphisms
- On the number of Abelian square-free words on four letters
- Extremal overlap-free and extremal -free binary words
- On the number of \(\alpha \)-power-free binary words for \(2<\alpha \leq 7/3\)
- Subword complexity and power avoidance
- Growth of repetition-free words -- a review
- Overlap-free symmetric D0L words
- Shortest repetition-free words accepted by automata
- On patterns occurring in binary algebraic numbers
- Two-Sided Bounds for the Growth Rates of Power-Free Languages
- scientific article; zbMATH DE number 3912632 (Why is no real title available?)
- A linear-time algorithm to decide whether a binary word contains an overlap
- scientific article; zbMATH DE number 8008 (Why is no real title available?)
- Repetitions in the Fibonacci infinite word
- Algèbres effectives dans la programmation logique avec contraintes
- scientific article; zbMATH DE number 512830 (Why is no real title available?)
- Deciding context equivalence of binary overlap-free words in linear time
- If a DOL language is k-power free then it is circular
- Growth properties of power-free languages
- scientific article; zbMATH DE number 3995072 (Why is no real title available?)
- The number of threshold words on \(n\) letters grows exponentially for every \(n \geq 27\)
- The repetition threshold for binary rich words
- Infinite words containing squares at every position
- Computing the Growth of the Number of Overlap-Free Words with Spectra of Matrices
- Symbol Separation in Double Occurrence Words
- Polynomial versus exponential growth in repetition-free binary words
- The analog of overlap-freeness for the period-doubling sequence
- A rewriting of Fife's theorem about overlap-free words
- Construction of a bi-infinite power free word with a given factor and a non-recurrent letter
- On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters
- The first-order theory of binary overlap-free words is decidable
- The analogue of overlap-freeness for the Fibonacci morphism
- Low complexity binary words avoiding (5/2)^+-powers
- Overlap-free words and spectra of matrices
- On the context-freeness of the set of words containing overlaps
- Growth rate of binary words avoiding \(xxx^{R}\)
- Growth rates of complexity of power-free languages
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3689370)
