REMARKS CONCERNING THE D0L ω-EQUIVALENCE PROBLEM

DOI10.1142/S0129054102001448MaRDI QIDQ3021985zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• THE D0L ω-EQUIVALENCE PROBLEM
• The ω sequence problem for DOL systems is decidable
• scientific article; zbMATH DE number 2016846
• An \(n^2\)-bound for the ultimate equivalence problem of certain D0L systems over an \(n\)-letter alphabet
• scientific article; zbMATH DE number 3872709

Cites work

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

Cited in

(9)

• A bound for theω-equivalence problem of polynomial D0L systems
• scientific article; zbMATH DE number 2016846 (Why is no real title available?)
• scientific article; zbMATH DE number 4055075 (Why is no real title available?)
• On infinite HD0L words having sparse letters
• The equality problem for purely substitutive words
• The ω sequence problem for DOL systems is decidable
• HD0L \(\omega \)-equivalence and periodicity problems in the primitive case
• scientific article; zbMATH DE number 3940748 (Why is no real title available?)
• THE D0L ω-EQUIVALENCE PROBLEM

This page was built for publication: REMARKS CONCERNING THE D0L ω-EQUIVALENCE PROBLEM

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