The equality problem for infinite words generated by primitive morphisms

DOI10.1016/j.ic.2009.01.002zbMath1167.68048OpenAlexW2083894684MaRDI QIDQ2389351

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)

Related Items (1)

Morphic words, Beatty sequences and integer images of the Fibonacci language

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new bound for the D0L sequence equivalence problem
• The sequence equivalence problem for primitive D0L systems
• An \(n^2\)-bound for the ultimate equivalence problem of certain D0L systems over an \(n\)-letter alphabet
• THE D0L ω-EQUIVALENCE PROBLEM
• The ω sequence problem for DOL systems is decidable
• Automatic Sequences
• A bound for theω-equivalence problem of polynomial D0L systems

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