REMARKS CONCERNING THE D0L ω-EQUIVALENCE PROBLEM

DOI10.1142/S0129054102001448zbMath1066.68059OpenAlexW2066283926MaRDI QIDQ3021985

Juha Honkala

Publication date: 22 June 2005

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054102001448

zbMATH Keywords

decidabilityD0L system\(\omega\)-equivalenceinfinite D0L word

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items

A bound for theω-equivalence problem of polynomial D0L systems, On infinite HD0L words having sparse letters, THE D0L ω-EQUIVALENCE PROBLEM

Cites Work

• On infinite words obtained by iterating morphisms
• On the decidability of the sequence equivalence problem for DOL-systems
• Elementary homomorphisms and a solution of the DOL sequence equivalence problem
• The ω sequence problem for DOL systems is decidable
• The decidability of the equivalence problem for DOL-systems