Recommendations
Cites work
- scientific article; zbMATH DE number 6004833 (Why is no real title available?)
- scientific article; zbMATH DE number 3648963 (Why is no real title available?)
- scientific article; zbMATH DE number 3138903 (Why is no real title available?)
- scientific article; zbMATH DE number 3871492 (Why is no real title available?)
- scientific article; zbMATH DE number 3808970 (Why is no real title available?)
- scientific article; zbMATH DE number 3811868 (Why is no real title available?)
- scientific article; zbMATH DE number 3912631 (Why is no real title available?)
- scientific article; zbMATH DE number 3912632 (Why is no real title available?)
- scientific article; zbMATH DE number 3780589 (Why is no real title available?)
- scientific article; zbMATH DE number 512830 (Why is no real title available?)
- scientific article; zbMATH DE number 740754 (Why is no real title available?)
- scientific article; zbMATH DE number 2000848 (Why is no real title available?)
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- scientific article; zbMATH DE number 3238653 (Why is no real title available?)
- scientific article; zbMATH DE number 3293666 (Why is no real title available?)
- A Characterization of the Morse Minimal Set
- A generator of morphisms for infinite words
- A proof of Dejean’s conjecture
- A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
- An Inversion Theorem for Cluster Decompositions of Sequences with Distinguished Subsequences
- Automata and forbidden words
- BINARY PATTERNS IN BINARY WORDS
- Binary patterns in binary cube-free words: avoidability and growth
- Combinatorial Complexity of Regular Languages
- Combinatorics on words in information security: unavoidable regularities in the construction of multicollision attacks on iterated hash functions
- Comparing Complexity Functions of a Language and Its Extendable Part
- Conjugacy and Equivalence of Weighted Automata and Functional Transducers
- Definability of combinatorial functions and their linear recurrence relations
- Dejean's conjecture and Sturmian words
- Dejean's conjecture holds for N ≥ 27
- Depth-First Search and Linear Graph Algorithms
- Efficient lower bounds on the number of repetition-free words
- Enumeration of irreducible binary words
- Factorial Languages of Low Combinatorial Complexity
- Graded algebras
- Growth of power-free languages over large alphabets
- Growth of repetition-free words -- a review
- Growth problems for avoidable words
- Growth properties of power-free languages
- Growth rates of complexity of power-free languages
- Infinite words containing squares at every position
- Introduction to precise numerical methods. With CD-ROM.
- Last cases of Dejean's conjecture
- NON-REPETITIVE SEQUENCES ON THREE SYMBOLS
- Nonrepetitive colorings of graphs
- On Abelian repetition threshold
- On Dejean's conjecture over large alphabets
- On Pansiot words avoiding 3-repetitions
- On repetition-free binary words of minimal density
- On the entropy and letter frequencies of ternary square-free words
- On the existence of minimal \(\beta \)-powers
- On the growth rates of complexity of threshold languages
- On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters
- On the number of \(\alpha \)-power-free binary words for \(2<\alpha \leq 7/3\)
- On two stronger versions of Dejean's conjecture
- Overlap-free words and spectra of matrices
- Polynomial versus exponential growth in repetition-free binary words
- Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters
- Repetition-free words
- SIMULTANEOUS AVOIDANCE OF LARGE SQUARES AND FRACTIONAL POWERS IN INFINITE BINARY WORDS
- Sur un théorème de Thue
- The Goulden—Jackson cluster method: extensions, applications and implementations
- The structure of the set of cube-free \(Z\)-words in a two-letter alphabet
- Two-Sided Bounds for the Growth Rates of Power-Free Languages
- Uniformly growing k-th power-free homomorphisms
- WORDS AVOIDING $\frac{7}{3}$-POWERS AND THE THUE–MORSE MORPHISM
Cited in
(21)- Branching frequency and Markov entropy of repetition-free languages
- Palindromic rich words and run-length encodings
- Counting ternary square-free words quickly
- Critical exponent of binary words with few distinct palindromes
- Growth rate of binary words avoiding \(xxx^{R}\)
- Bayes posterior convergence for loss functions via almost additive thermodynamic formalism
- Computing the maximum exponent in a stream
- Lower-bounds on the growth of power-free languages over large alphabets
- scientific article; zbMATH DE number 6503311 (Why is no real title available?)
- Subword complexity and power avoidance
- LANGUAGES WITH A FINITE ANTIDICTIONARY: SOME GROWTH QUESTIONS
- Growth properties of power-free languages
- Growth rates of power-free languages
- On the tree of ternary square-free words
- Repetition-free words
- Growth and ergodicity of context-free languages
- Generating square-free words efficiently
- On a generalization of Thue sequences
- Growth of power-free languages over large alphabets
- On shuffled-square-free words
- The number of threshold words on \(n\) letters grows exponentially for every \(n \geq 27\)
This page was built for publication: Growth properties of power-free languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q465700)
