On the decidability of the OL-DOL equivalence problem

DOI10.1016/S0019-9958(79)90797-6zbMATH Open0412.68062MaRDI QIDQ4199549FDOQ4199549

Authors: Keijo Ruohonen 

Publication date: 1979

Published in: Information and Control (Search for Journal in Brave)

zbMATH Keywords

Lindenmayer systemsdecidabilityequivalence problem

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Decidability of theories and sets of sentences (03B25)

Cited In (5)

• The language equivalence problem for HD0L systems having D0L growths
• The decidability of the DOL-DTOL equivalence problem
• The equivalence problem for DF0L languages and power series.
• The decidability of the FOL-DOL equivalence problem
• Lindenmayer systems

This page was built for publication: On the decidability of the OL-DOL equivalence problem

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