Simple reductions between \(D0L\) language and sequence equivalence problems

DOI10.1016/0166-218X(90)90061-GzbMath0788.68086MaRDI QIDQ1208490

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)

Related Items (3)

Bounds for the D0L language equivalence problem ⋮ A new bound for the D0L language equivalence problem ⋮ The language equivalence problem for HD0L systems having D0L growths

Cites Work

• On the decidability of some equivalence problems for DOL-systems
• Unnamed Item
• Unnamed Item

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