On the simplification of infinite morphic words

DOI10.1016/J.TCS.2008.12.037MaRDI QIDQ1006088zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• On the power of periodic iteration of morphisms
• Some properties of substitutive words
• On the periodicity of morphic words
• Decidability of periodicity for infinite words
• The equality problem for infinite words generated by primitive morphisms

Cites work

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

Cited in

(8)

• Decidable problems in substitution shifts
• General framework
• Asymptotic properties of free monoid morphisms
• The monadic theory of morphic infinite words and generalizations
• Some properties of substitutive words
• From combinatorial games to shape-symmetric morphisms
• Morphic and automatic words: maximal blocks and Diophantine approximation
• Decidability of uniform recurrence of morphic sequences

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1006088)