On the subword equivalence problem for morphic words
From MaRDI portal
Publication:1363770
DOI10.1016/S0166-218X(97)89162-7zbMATH Open0879.68064OpenAlexW2066275073MaRDI QIDQ1363770FDOQ1363770
Authors: 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
Recommendations
Cites Work
- Power of words and recognizability of fixpoints of a substitution
- Uniform tag sequences
- Substitution dynamical systems - spectral analysis
- Title not available (Why is that?)
- On the periodicity of morphisms on free monoids
- Decidability of periodicity for infinite words
- A remark on morphic sturmian words
- The decidability of the equivalence problem for DOL-systems
- Repetition of subwords in DOL languages
- Title not available (Why is that?)
- On binary equality sets and a solution to the test set conjecture in the binary case
- The ω sequence problem for DOL systems is decidable
Cited In (12)
- Invertible substitutions and local isomorphisms
- Equivalence of right infinite words
- Title not available (Why is that?)
- Logarithmic equal-letter runs for BWT of purely morphic words
- Mirror substitutions and palindromic sequences
- Morphic words and equidistributed sequences
- The equality problem for infinite words generated by primitive morphisms
- Cobham's theorem and its extensions
- Decidability of uniform recurrence of morphic sequences
- Title not available (Why is that?)
- Extremal words in morphic subshifts
- On the subword equivalence problem for infinite words
This page was built for publication: On the subword equivalence problem for morphic words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1363770)
