Properties of infinite words : Recent results
From MaRDI portal
Publication:5096141
DOI10.1007/BFb0028971zbMath1492.68077OpenAlexW1544907355MaRDI QIDQ5096141
Publication date: 16 August 2022
Published in: STACS 89 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bfb0028971
Combinatorics on words (68R15) Formal languages and automata (68Q45) Semigroups in automata theory, linguistics, etc. (20M35)
Related Items (5)
On repeated factors in \(C^\infty\)-words ⋮ Reversing and extended symmetries of shift spaces ⋮ Iterative devices generating infinite words ⋮ A new pumping lemma for indexed languages, with an application to infinite words ⋮ On infinite words determined by L systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An infinite square-free co-CFL
- A permutational property of groups
- On the Burnside problem for semigroups
- Every iterated morphism yields a co-CFL
- Analytic models and ambiguity of context-free languages
- Applications of an infinite square-free co-CFL
- An infinite word language which is not co-CFL
- Rewriting products of group elements. I
- Prefixes of infinite words and ambiguous context-free languages
- Iterated GSMs and CO-CFL
- Permutation properties and the Fibonacci semigroup
- A generalization of automatic sequences
- Some combinatorial properties of the Thue-Morse sequence and a problem in semigroups
- Factorial languages whose growth function is quadratically upper bounded
- On the subword complexity of square-free DOL languages
- On infinite words obtained by iterating morphisms
- Infinite words and permutation properties
- Infinite words with linear subword complexity
- Enumeration of factors in the Thue-Morse word
- On cube-free \(\omega\)-words generated by binary morphisms
- Unending chess, symbolic dynamics and a problem in semi-groups
- An “Interchange Lemma” for Context-Free Languages
- On the periodicity of morphisms on free monoids
- Sur les centres de DOL-langages
- A Generalization of Ogden's Lemma
- Decidability of periodicity for infinite words
- Uniform tag sequences
This page was built for publication: Properties of infinite words : Recent results
