A new bound for the D0L language equivalence problem

DOI10.1007/s00236-016-0286-xzbMath1386.68092OpenAlexW2550759788MaRDI QIDQ1702303

Juha Honkala

Publication date: 28 February 2018

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-016-0286-x

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Cites Work

• Unnamed Item
• Unnamed Item
• Bounds for the D0L language equivalence problem
• A new bound for the D0L sequence equivalence problem
• Simple reductions between \(D0L\) language and sequence equivalence problems
• On the decidability of some equivalence problems for DOL-systems

This page was built for publication: A new bound for the D0L language equivalence problem