On the simplification of infinite morphic words

DOI10.1016/j.tcs.2008.12.037zbMath1162.68031OpenAlexW2062701013MaRDI QIDQ1006088

Juha Honkala

Publication date: 17 March 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.12.037

zbMATH Keywords

infinite wordmorphic wordelementary morphism

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (5)

Asymptotic properties of free monoid morphisms ⋮ Decidable problems in substitution shifts ⋮ General Framework ⋮ From Combinatorial Games to Shape-Symmetric Morphisms ⋮ DECIDABILITY OF UNIFORM RECURRENCE OF MORPHIC SEQUENCES

Cites Work

• Unnamed Item
• Elementary homomorphisms and a solution of the DOL sequence equivalence problem
• The equivalence problem of polynomially bounded D0L systems -- a bound depending only on the size of the alphabet
• Hierarchie et fermeture de certaines classes de tag-systèmes
• The equivalence problem for DF0L languages and power series.
• Cancellation and periodicity properties of iterated morphisms
• THE D0L ω-EQUIVALENCE PROBLEM
• On the periodicity of morphisms on free monoids
• The decidability of the dol prefix problem
• Simplifications of homomorphisms
• Automatic Sequences
• Decidability of periodicity for infinite words

This page was built for publication: On the simplification of infinite morphic words