Some non finitely generated monoids of repetition-free endomorphisms.
From MaRDI portal
Publication:1853181
DOI10.1016/S0020-0190(02)00354-XzbMath1042.68070MaRDI QIDQ1853181
Publication date: 21 January 2003
Published in: Information Processing Letters (Search for Journal in Brave)
68Q45: Formal languages and automata
Related Items
On stabilizers of infinite words, There are \(k\)-uniform cubefree binary morphisms for all \(k \geq 0\), Overlap-free morphisms and finite test-sets, Existence of finite test-sets for \(k\)-power-freeness of uniform morphisms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Primitive morphisms
- Avoidable patterns in strings of symbols
- Sharp characterizations of squarefree morphisms
- Some results on \(k\)-power-free morphisms
- Uniformly growing k-th power-free homomorphisms
- Overlap-free morphisms and finite test-sets
- Characterization of test-sets for overlap-free morphisms
- A test-set fork-power-free binary morphisms