Non-repetitive words: Ages and essences
From MaRDI portal
Publication:1912750
DOI10.1007/BF01300125zbMath0847.68057MaRDI QIDQ1912750
Publication date: 7 October 1996
Published in: Combinatorica (Search for Journal in Brave)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Growth problems for avoidable words
- Arithmetic progressions in partially ordered sets
- Avoidable patterns in strings of symbols
- Strongly non-repetitive sequences and progression-free sets
- Every binary pattern of length six is avoidable on the two-letter alphabet
- On nonrepetitive sequences
- Infinite words with linear subword complexity
- On cube-free \(\omega\)-words generated by binary morphisms
- Chains and fixing blocks in irreducible binary sequences
- Embedding the dual of \(\Pi^\infty\) in the lattice of equational classes of semigroups.
- Sur un théorème de Thue
- Characterization of the repetitive commutative semigroups
- Which graphs allow infinite nonrepetitive walks?
- NON-REPETITIVE SEQUENCES ON THREE SYMBOLS
- BLOCKING SETS OF TERMS
- Aperiodic words on three symbols.
- Binary Sequences which Contain no BBb
- Open Problems in Pattern Avoidance
- Is There a Sequence on Four Symbols in Which No Two Adjacent Segments are Permutations of One Another?
- Symbolic Dynamics
This page was built for publication: Non-repetitive words: Ages and essences
