On the decidability of the sequence equivalence problem for DOL-systems

DOI10.1016/0304-3975(76)90066-9zbMATH Open0352.68103OpenAlexW2021080624MaRDI QIDQ1235985FDOQ1235985

Authors: Karel II Culik 

Publication date: 1977

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(76)90066-9

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Genetics and epigenetics (92D10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Extension of tabled 0L-systems and languages
• On the decidability of some equivalence problems for DOL-systems
• On some families of languages related to developmental systems
• Title not available (Why is that?)
• Closure properties of some families of languages associated with biological systems
• The unsolvability of the equality problem for sentential forms of context-free grammars
• Integral sequential word functions and growth equivalence of lindenmayer systems
• Title not available (Why is that?)

Cited In (8)

• Lindenmayer grammars and symbolic testing
• Homomorphism equivalence on etol languages†
• On the decidability of homomorphism equivalence for languages
• REMARKS CONCERNING THE D0L ω-EQUIVALENCE PROBLEM
• Title not available (Why is that?)
• Balance of many-valued transductions and equivalence problems
• A survey on decidable equivalence problems for tree transducers
• THE D0L ω-EQUIVALENCE PROBLEM

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

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