On the subword equivalence problem for morphic words
From MaRDI portal
Publication:1363770
Recommendations
Cites work
- scientific article; zbMATH DE number 4112045 (Why is no real title available?)
- scientific article; zbMATH DE number 3767067 (Why is no real title available?)
- A remark on morphic sturmian words
- Decidability of periodicity for infinite words
- On binary equality sets and a solution to the test set conjecture in the binary case
- On the periodicity of morphisms on free monoids
- Power of words and recognizability of fixpoints of a substitution
- Repetition of subwords in DOL languages
- Substitution dynamical systems - spectral analysis
- The decidability of the equivalence problem for DOL-systems
- The ω sequence problem for DOL systems is decidable
- Uniform tag sequences
Cited in
(12)- Extremal words in morphic subshifts
- Decidability of uniform recurrence of morphic sequences
- Logarithmic equal-letter runs for BWT of purely morphic words
- Morphic words and equidistributed sequences
- The equality problem for infinite words generated by primitive morphisms
- Mirror substitutions and palindromic sequences
- Invertible substitutions and local isomorphisms
- scientific article; zbMATH DE number 5074393 (Why is no real title available?)
- On the subword equivalence problem for infinite words
- Cobham's theorem and its extensions
- Equivalence of right infinite words
- scientific article; zbMATH DE number 3910468 (Why is no real title available?)
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)
