Simple reductions between D0L language and sequence equivalence problems

DOI10.1016/0166-218X(90)90061-GMaRDI QIDQ1208490zbMATH OpenFDO

Authors Arto Salomaa

Publication date 16 May 1993

Published in Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

D0L sequence equivalence problemD0L language equivalence problem

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Bounds for the D0L language equivalence problem
• A new bound for the D0L language equivalence problem
• The equivalence problem for languages defined by transductions on D0L languages
• scientific article; zbMATH DE number 4045201
• The equivalence problem for DF0L languages and power series.
• The sequence equivalence problem for primitive D0L systems
• On the equivalence problem of context-free and DT0L languages
• The ω sequence problem for DOL systems is decidable
• scientific article; zbMATH DE number 4139308
• Decidability of the equivalence problem for deterministic pushdown automata

Cites work

• scientific article; zbMATH DE number 48028 (Why is no real title available?)
• scientific article; zbMATH DE number 3569855 (Why is no real title available?)
• On the decidability of some equivalence problems for DOL-systems

Cited in

(5)

• A new bound for the D0L language equivalence problem
• Bounds for the D0L language equivalence problem
• The language equivalence problem for HD0L systems having D0L growths
• scientific article; zbMATH DE number 1361492 (Why is no real title available?)
• The equivalence problem for languages defined by transductions on D0L languages

This page was built for publication: Simple reductions between \(D0L\) language and sequence equivalence problems

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