Uniformly growing k-th power-free homomorphisms
From MaRDI portal
Publication:1838047
DOI10.1016/0304-3975(88)90009-6zbMath0508.68051OpenAlexW2060459509MaRDI QIDQ1838047
Publication date: 1983
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(88)90009-6
Related Items
Repetition-free words, Systèmes codés. (Coded systems), Initial non-repetitive complexity of infinite words, RATIONAL APPROXIMATIONS OF POLYNOMIAL FACTORIAL LANGUAGES, A ternary square-free sequence avoiding factors equivalent to \(abcacba\), A proof of Dejean’s conjecture, Counting ternary square-free words quickly, On the entropy and letter frequencies of powerfree words, ON THE EXISTENCE OF MINIMAL β-POWERS, Exponential lower bounds for the number of words of uniform length avoiding a pattern, On Abelian repetition threshold, Lengths of extremal square-free ternary words., Reduction in non-(k+ 1)-power-free morphisms, Multidimensional unrepetitive configurations, The number of binary words avoiding Abelian fourth powers grows exponentially, Squarefree words with interior disposable factors, Dejean's conjecture and Sturmian words, Polynomial versus exponential growth in repetition-free binary words, Enumeration of irreducible binary words, The undirected repetition threshold and undirected pattern avoidance, On \(k\)-abelian avoidability, On the number of Abelian square-free words on four letters, Growth of power-free languages over large alphabets, Growth of power-free languages: numerical and asymptotic bounds, Enumeration of two dimensional palindromes, Minimal critical exponent of quasiperiodic words, Circular repetition thresholds on some small alphabets: last cases of Gorbunova's conjecture, Square-free words with square-free self-shuffles, Volume formula and growth rates of the balls of strings under the edit distances, Growth rate of binary words avoiding \(xxx^{R}\), Square-free words obtained from prefixes by permutations, Rich words in the block reversal of a word, Tight Upper Bounds on Distinct Maximal (Sub-)Repetitions in Highly Compressible Strings, A family of formulas with reversal of high avoidability index, Growth problems for avoidable words, Growth properties of power-free languages, AVOIDING APPROXIMATE SQUARES, Counting Ordered Patterns in Words Generated by Morphisms, If a DOL language is k-power free then it is circular, On Dejean's conjecture over large alphabets, On the number of partially abelian square-free words on a three-letter alphabet, A uniform cube-free morphism isk-power-free for all integersk≥ 4, Square-free shuffles of words, Freeness of partial words, Relations on words, CONJECTURES AND RESULTS ON MORPHISMS GENERATING k-POWER-FREE WORDS, Relatively free semigroups of intermediate growth, There are \(k\)-uniform cubefree binary morphisms for all \(k \geq 0\), Growth of repetition-free words -- a review, The entropy of square-free words, Bounds for the generalized repetition threshold, On shuffling of infinite square-free words, Pattern avoidance: themes and variations, The Number of Threshold Words on $n$ Letters Grows Exponentially for Every $n\geq 27$, Dejean's conjecture holds for \(n\geq 30\), Partially abelian squarefree words, Problems in between words and abelian words: \(k\)-abelian avoidability, On the growth rates of complexity of threshold languages, Growth rates of complexity of power-free languages, Actions of small cancellation groups on hyperbolic spaces, Every real number greater than 1 is a critical exponent, On the least number of palindromes in two-dimensional words, Polynomial languages with finite antidictionaries, Two-Sided Bounds for the Growth Rates of Power-Free Languages, On intermediate factorial languages, Dejean's conjecture holds for N ≥ 27, Growth rates of power-free languages, On cube-free \(\omega\)-words generated by binary morphisms, Total palindrome complexity of finite words, Some further results on squarefree arithmetic progressions in infinite words, A propos d'une conjecture de F. Dejean sur les répétitions dans les mots, A generalization of repetition threshold, Some non finitely generated monoids of repetition-free endomorphisms., On the centers of the set of weakly square-free words on a two letter alphabet, On regularity of languages generated by copying systems, Some results on \(k\)-power-free morphisms, Computing the maximum exponent in a stream
Cites Work
