Every two equivalent DOL systems have a regular true envelope

DOI10.1016/0304-3975(80)90071-7MaRDI QIDQ1157969zbMATH OpenOpenAlexFDO

Authors Andrzej Ehrenfeucht, Grzegorz Rozenberg

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)

Cites work

• scientific article; zbMATH DE number 3644504 (Why is no real title available?)
• Elementary homomorphisms and a solution of the DOL sequence equivalence problem
• The decidability of the equivalence problem for DOL-systems

Cited in

(3)

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

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

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