The equality problem for infinite words generated by primitive morphisms

DOI10.1016/J.IC.2009.01.002MaRDI QIDQ2389351zbMATH OpenOpenAlexFDO

Authors Juha Honkala

Publication date 15 July 2009

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ic.2009.01.002

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Recommendations

• On the subword equivalence problem for morphic words
• Binary equality words with two b's.
• On the subword equivalence problem for infinite words
• Decidability of periodicity for infinite words
• On the power of periodic iteration of morphisms

Cites work

• A bound for theω-equivalence problem of polynomial D0L systems
• A new bound for the D0L sequence equivalence problem
• An \(n^2\)-bound for the ultimate equivalence problem of certain D0L systems over an \(n\)-letter alphabet
• Automatic Sequences
• scientific article; zbMATH DE number 3569855 (Why is no real title available?)
• scientific article; zbMATH DE number 1737190 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• THE D0L ω-EQUIVALENCE PROBLEM
• The sequence equivalence problem for primitive D0L systems
• The ω sequence problem for DOL systems is decidable

Cited in

(11)

• On the simplification of infinite morphic words
• An algorithm for checking the equality of infinite catenations of finite languages
• On the subword equivalence problem for morphic words
• On the factors of automatic words
• Equivalence of right infinite words
• The ``equal last letter predicate for words on infinite alphabets and classes of multitape automata
• Morphic words, Beatty sequences and integer images of the Fibonacci language
• On the equivalence of the two existing extensions of the leximax criterion to the infinite case
• THE EQUALITY CONDITION FOR INFINITE CATENATIONS OF TWO SETS OF FINITE WORDS
• On the subword equivalence problem for infinite words
• Binary equality words with two b's.

This page was built for publication: The equality problem for infinite words generated by primitive morphisms

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