The decidability of the FOL-DOL equivalence problem

DOI10.1016/0020-0190(79)90119-4zbMath0403.68068OpenAlexW2006520807MaRDI QIDQ1256322

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

Formal LanguageEquivalence ProblemDevelopmental SystemLindemayer System

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

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 ⋮ Watson-Crick D0L systems with regular triggers

Cites Work

• The decidability of the equivalence problem for DOL-systems
• On the decidability of the OL-DOL equivalence problem
• On the decidability of some equivalence problems for DOL-systems
• Unnamed Item
• Unnamed Item
• Unnamed Item