scientific article
From MaRDI portal
zbMath0572.20038MaRDI QIDQ3689370
Sergio Salemi, Antonio Restivo
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05)
Related Items
Repetition-free words, Overlap-free words and spectra of matrices, On the context-freeness of the set of words containing overlaps, On the length of word chains, Some combinatorial properties of the Thue-Morse sequence and a problem in semigroups, Polynomial versus exponential growth in repetition-free binary words, Repetitions in the Fibonacci infinite word, Algèbres effectives dans la programmation logique avec contraintes, On the number of Abelian square-free words on four letters, Growth rate of binary words avoiding \(xxx^{R}\), 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 patterns occurring in binary algebraic numbers, Deciding context equivalence of binary overlap-free words in linear time, A linear-time algorithm to decide whether a binary word contains an overlap, Unnamed Item, Extremal overlap-free and extremal \(\beta\)-free binary words, On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters, Growth properties of power-free languages, If a DOL language is k-power free then it is circular, Growth of repetition-free words -- a review, The Number of Threshold Words on $n$ Letters Grows Exponentially for Every $n\geq 27$, On the number of \(\alpha \)-power-free binary words for \(2<\alpha \leq 7/3\), Infinite words containing squares at every position, Growth rates of complexity of power-free languages, The repetition threshold for binary rich words, Computing the Growth of the Number of Overlap-Free Words with Spectra of Matrices, Overlap-freeness in infinite partial words, Two-Sided Bounds for the Growth Rates of Power-Free Languages, Periodicity and the golden ratio, Growth rates of power-free languages, Subword complexity and power avoidance, A characterization of overlap-free morphisms
