Growth problems for avoidable words
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3878866 (Why is no real title available?)
- scientific article; zbMATH DE number 3987347 (Why is no real title available?)
- scientific article; zbMATH DE number 4004483 (Why is no real title available?)
- scientific article; zbMATH DE number 4023572 (Why is no real title available?)
- scientific article; zbMATH DE number 3732062 (Why is no real title available?)
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 3767067 (Why is no real title available?)
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- scientific article; zbMATH DE number 3894492 (Why is no real title available?)
- scientific article; zbMATH DE number 3204690 (Why is no real title available?)
- scientific article; zbMATH DE number 3219506 (Why is no real title available?)
- scientific article; zbMATH DE number 3028781 (Why is no real title available?)
- A Sequence Without Repeats on x, x -1 , y, y -1
- Aperiodic words on three symbols.
- Aperiodic words on three symbols. II.
- Avoidable patterns in strings of symbols
- Avoidable patterns on two letters
- BLOCKING SETS OF TERMS
- Embedding the dual of \(\Pi^\infty\) in the lattice of equational classes of semigroups.
- Ergodic theory on compact spaces
- Finite basis theorem for systems of semigroup identities
- INFINITE PERIODIC GROUPS. I
- INHERENTLY NONFINITELY BASED FINITE SEMIGROUPS
- Intervals in the lattice of varieties
- NON-REPETITIVE SEQUENCES ON THREE SYMBOLS
- New estimates of odd exponents of infinite Burnside groups.
- Repetition-free words
- Unending chess, symbolic dynamics and a problem in semi-groups
- Uniformly growing k-th power-free homomorphisms
Cited in
(48)- Binary patterns in binary cube-free words: avoidability and growth
- Relatively free semigroups of intermediate growth
- Every binary pattern of length six is avoidable on the two-letter alphabet
- THE EXISTENCE OF A PATTERN WHICH IS 5-AVOIDABLE BUT 4-UNAVOIDABLE
- Growth properties of power-free languages
- Non-repetitive words: Ages and essences
- Avoiding conjugacy classes on the 5-letter alphabet
- Pattern avoidance: themes and variations
- Polynomial growth in semigroup varieties.
- The set of \(k\)-power free words over \(\Sigma\) is empty or perfect
- Doubled patterns are 3-avoidable
- The unambiguity of segmented morphisms
- On the structure and extendibility of \(k\)-power free words
- Growth rate of binary words avoiding \(xxx^{R}\)
- Binary words avoiding the pattern AABBCABBA
- Avoidability of formulas with two variables
- On the entropy and letter frequencies of powerfree words
- On some interesting ternary formulas
- Density dichotomy in random words
- Avoiding or limiting regularities in words
- Further applications of a power series method for pattern avoidance
- Avoidability of palindrome patterns
- A generator of morphisms for infinite words
- Pattern avoidance on graphs
- scientific article; zbMATH DE number 4035171 (Why is no real title available?)
- scientific article; zbMATH DE number 3873334 (Why is no real title available?)
- Repetition avoidance in products of factors
- Avoiding patterns in the abelian sense
- A cyclic binary morphism avoiding abelian fourth powers
- Characterization of some binary words with few squares
- Thue type problems for graphs, points, and numbers
- On repetition-free binary words of minimal density
- On weakly self-avoiding words
- Avoidability of formulas with two variables
- Exponential lower bounds for the number of words of uniform length avoiding a pattern
- Doubled patterns with reversal and square-free doubled patterns
- Avoidability of circular formulas
- Growth, unavoidable words, and M. Sapir's conjecture for semigroup varieties.
- Sequence avoiding any complete word
- A family of formulas with reversal of high avoidability index
- Avoiding square-free words on free groups
- Formulas with reversal
- Unavoidable binary patterns
- Avoidance bases for formulas with reversal
- Some combinatorial properties of Arshon sequences of arbitrary orders
- Some variations on a theme of Irina Mel'nichuk concerning the avoidability of patterns in strings of symbols
- The number of binary words avoiding Abelian fourth powers grows exponentially
- Weakly self-avoiding words and a construction of Friedman
This page was built for publication: Growth problems for avoidable words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q908709)
