Every two equivalent DOL systems have a regular true envelope

DOI10.1016/0304-3975(80)90071-7zbMath0471.68048OpenAlexW2009694637MaRDI QIDQ1157969

Grzegorz Rozenberg, Andrzej Ehrenfeucht

Publication date: 1980

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(80)90071-7

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

On the active and full use of memory in right-boundary grammars and push- down automata ⋮ Dominoes over a free monoid ⋮ An \(n^2\)-bound for the ultimate equivalence problem of certain D0L systems over an \(n\)-letter alphabet

Cites Work

• Unnamed Item
• Elementary homomorphisms and a solution of the DOL sequence equivalence problem
• The decidability of the equivalence problem for DOL-systems

This page was built for publication: Every two equivalent DOL systems have a regular true envelope