The decidability of the FOL-DOL equivalence problem

DOI10.1016/0020-0190(79)90119-4MaRDI QIDQ1256322zbMATH OpenOpenAlexFDO

Authors Keijo Ruohonen

Publication date 1979

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(79)90119-4

zbMATH Keywords

Equivalence ProblemFormal LanguageDevelopmental SystemLindemayer System

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• scientific article; zbMATH DE number 3540642 (Why is no real title available?)
• scientific article; zbMATH DE number 3553774 (Why is no real title available?)
• scientific article; zbMATH DE number 3569855 (Why is no real title available?)
• On the decidability of some equivalence problems for DOL-systems
• On the decidability of the OL-DOL equivalence problem
• The decidability of the equivalence problem for DOL-systems

Cited in

(5)

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

This page was built for publication: The decidability of the FOL-DOL equivalence problem

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