On the decidability of the OL-DOL equivalence problem

From MaRDI portal

Revision as of 13:20, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4199549

Jump to:navigation, search

DOI10.1016/S0019-9958(79)90797-6zbMath0412.68062MaRDI QIDQ4199549

Keijo Ruohonen

Publication date: 1979

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

zbMATH Keywords

decidability Lindenmayer systems equivalence problem

Mathematics Subject Classification ID

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

Related Items (5)

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

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4199549&oldid=18046366"