Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
Watson-Crick walks and roads on DOL graphs
Acta Cybernetica
Language-theoretic aspects of DNA complementarity
Theoretical Computer Science
Watson—Crick DOL systems with regular triggers
Theoretical Computer Science
Handbook of Formal Languages
Regulated Rewriting in Formal Language Theory
Regulated Rewriting in Formal Language Theory
Mathematical Theory of L Systems
Mathematical Theory of L Systems
Power and size of extended Watson--Crick Lsystems
Theoretical Computer Science
Computation: finite and infinite machines
Computation: finite and infinite machines
DNA Computing: New Computing Paradigms
DNA Computing: New Computing Paradigms
| Hi-index | 5.23 |
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.