On the subword equivalence problem for morphic words

DOI10.1016/S0166-218X(97)89162-7zbMath0879.68064OpenAlexW2066275073MaRDI QIDQ1363770

Isabelle Fagnot

Publication date: 17 December 1997

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

subword equivalence problem

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45)

Related Items (4)

Mirror substitutions and palindromic sequences ⋮ Cobham’s theorem and its extensions ⋮ DECIDABILITY OF UNIFORM RECURRENCE OF MORPHIC SEQUENCES ⋮ Invertible substitutions and local isomorphisms

Cites Work

• Unnamed Item
• Unnamed Item
• On binary equality sets and a solution to the test set conjecture in the binary case
• Substitution dynamical systems - spectral analysis
• Power of words and recognizability of fixpoints of a substitution
• Repetition of subwords in DOL languages
• On the periodicity of morphisms on free monoids
• The ω sequence problem for DOL systems is decidable
• The decidability of the equivalence problem for DOL-systems
• A remark on morphic sturmian words
• Decidability of periodicity for infinite words
• Uniform tag sequences

This page was built for publication: On the subword equivalence problem for morphic words