The decidability of the FOL-DOL equivalence problem

DOI10.1016/0020-0190(79)90119-4zbMATH Open0403.68068OpenAlexW2006520807MaRDI QIDQ1256322FDOQ1256322

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

• Title not available (Why is that?)
• The decidability of the equivalence problem for DOL-systems
• Title not available (Why is that?)
• On the decidability of some equivalence problems for DOL-systems
• Title not available (Why is that?)
• On the decidability of the OL-DOL equivalence problem

Cited In (5)

• Watson-Crick D0L systems with regular triggers
• 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.
• Lindenmayer systems

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)