Growth properties of power-free languages
From MaRDI portal
Publication:465700
DOI10.1016/j.cosrev.2012.09.001zbMath1298.68157OpenAlexW1967466192WikidataQ60894991 ScholiaQ60894991MaRDI QIDQ465700
Publication date: 24 October 2014
Published in: Computer Science Review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cosrev.2012.09.001
Formal languages and automata (68Q45) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items
Branching frequency and Markov entropy of repetition-free languages ⋮ On the Tree of Ternary Square-Free Words ⋮ Counting ternary square-free words quickly ⋮ On shuffled-square-free words ⋮ Lower-bounds on the growth of power-free languages over large alphabets ⋮ Generating square-free words efficiently ⋮ The Number of Threshold Words on $n$ Letters Grows Exponentially for Every $n\geq 27$ ⋮ Palindromic rich words and run-length encodings ⋮ Subword complexity and power avoidance ⋮ LANGUAGES WITH A FINITE ANTIDICTIONARY: SOME GROWTH QUESTIONS ⋮ On a generalization of Thue sequences ⋮ Bayes posterior convergence for loss functions via almost additive thermodynamic formalism ⋮ Computing the maximum exponent in a stream
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Automata and forbidden words
- Last cases of Dejean's conjecture
- 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
- A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
- Overlap-free words and spectra of matrices
- Dejean's conjecture and Sturmian words
- Growth problems for avoidable words
- Growth rates of complexity of power-free languages
- Repetition-free words
- Enumeration of irreducible binary words
- Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters
- On repetition-free binary words of minimal density
- Uniformly growing k-th power-free homomorphisms
- On the entropy and letter frequencies of ternary square-free words
- On the number of \(\alpha \)-power-free binary words for \(2<\alpha \leq 7/3\)
- On Dejean's conjecture over large alphabets
- Growth of repetition-free words -- a review
- Sur un théorème de Thue
- Graded algebras
- The structure of the set of cube-free $ Z$-words in a two-letter alphabet
- Combinatorics on words in information security: Unavoidable regularities in the construction of multicollision attacks on iterated hash functions
- On Pansiot Words Avoiding 3-Repetitions
- On Abelian repetition threshold
- On Two Stronger Versions of Dejean’s Conjecture
- Binary patterns in binary cube-free words: Avoidability and growth
- SIMULTANEOUS AVOIDANCE OF LARGE SQUARES AND FRACTIONAL POWERS IN INFINITE BINARY WORDS
- A proof of Dejean’s conjecture
- NON-REPETITIVE SEQUENCES ON THREE SYMBOLS
- A generator of morphisms for infinite words
- Conjugacy and Equivalence of Weighted Automata and Functional Transducers
- Combinatorial Complexity of Regular Languages
- Comparing Complexity Functions of a Language and Its Extendable Part
- Growth of Power-Free Languages over Large Alphabets
- On the Existence of Minimal β-Powers
- Definability of Combinatorial Functions and Their Linear Recurrence Relations
- Factorial Languages of Low Combinatorial Complexity
- Two-Sided Bounds for the Growth Rates of Power-Free Languages
- Dejean's conjecture holds for N ≥ 27
- An Inversion Theorem for Cluster Decompositions of Sequences with Distinguished Subsequences
- BINARY PATTERNS IN BINARY WORDS
- The Goulden—Jackson cluster method: extensions, applications and implementations
- Nonrepetitive colorings of graphs
- Infinite words containing squares at every position
- On the growth rates of complexity of threshold languages
- Growth Properties of Power-Free Languages
- A Characterization of the Morse Minimal Set
- WORDS AVOIDING $\frac{7}{3}$-POWERS AND THE THUE–MORSE MORPHISM
- Depth-First Search and Linear Graph Algorithms
This page was built for publication: Growth properties of power-free languages
