Some non finitely generated monoids of repetition-free endomorphisms.
From MaRDI portal
Publication:1853181
DOI10.1016/S0020-0190(02)00354-XzbMath1042.68070OpenAlexW1965932039MaRDI QIDQ1853181
Publication date: 21 January 2003
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0190(02)00354-x
Related Items (4)
Overlap-free morphisms and finite test-sets ⋮ Existence of finite test-sets for \(k\)-power-freeness of uniform morphisms ⋮ On stabilizers of infinite words ⋮ There are \(k\)-uniform cubefree binary morphisms for all \(k \geq 0\)
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
This page was built for publication: Some non finitely generated monoids of repetition-free endomorphisms.
