Uni-transitional Watson-Crick D0L systems

DOI10.1016/S0304-3975(02)00026-9zbMath0996.68085MaRDI QIDQ1603703

Arto Salomaa

Publication date: 15 July 2002

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

zbMATH Keywords

decidabilityDNA computinggrowth functionsD0L sequencesWatson-Crick complementarityiterated morphisms

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (7)

A Connection Between Red-Green Turing Machines and Watson-Crick T0L Systems ⋮ Discrete Watson-Crick dynamical systems ⋮ Watson-Crick D0L systems: The power of one transition ⋮ Power and size of extended Watson-Crick \(L\) systems. ⋮ Decidability results for Watson-Crick D0L systems with nonregular triggers. ⋮ Networks of Watson-Crick D0L systems with communication by substrings ⋮ Extended Watson-Crick L systems with regular trigger languages and restricted derivation modes

Cites Work

• Dynamical properties of PWD0L systems
• Two theorems concerning recognizable \(N\)-subsets of \(\sigma^*\)
• Morphic congruences and D0L languages
• Language-theoretic aspects of DNA complementarity
• TOL schemes and control sets
• Aspects of Molecular Computing
• Watson-Crick D0L systems with regular triggers
• Easy cases of the D0L sequence equivalence problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Uni-transitional Watson-Crick D0L systems