Abstract
The properties of Watson–Crick D0L system, a language–theoretical formalism inspired by natural DNA processing, are studied. The model incorporates the iterated D0L-like morphism and the DNA complementarity principle represented by a letter-to-letter morphism. These two morphisms are connected by a natural condition called the trigger.We show first that this very simple model has rather unexpected power; it can closely and simply simulate any Minsky register machine. As a consequence, any recursively enumerable language can be obtained as a projection of the language of some standard Watson–Crick D0L system. Finally, we show that the graph reachability problem, equivalence problems and some other problems of standard Watson–Crick D0L systems are undecidable.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.