Watson-Crick D0L systems with regular triggers

DOI10.1016/S0304-3975(01)00010-XzbMath0972.68099MaRDI QIDQ5941302

Juha Honkala, Arto Salomaa

Publication date: 20 August 2001

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

zbMATH Keywords

decidabilityD0L sequencesLindenmayer systemsWatson-Crick complementarity

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items

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 ⋮ Watson-Crick D0L systems: Generative power and undecidable problems. ⋮ On Some Biologically Motivated Control Devices for Parallel Rewriting ⋮ On the Images of ℕ-Rational Sequences Counting Multiplicities ⋮ Uni-transitional Watson-Crick D0L systems ⋮ Extended Watson-Crick L systems with regular trigger languages and restricted derivation modes

Cites Work

• Dynamical properties of PWD0L systems
• The decidability of the FOL-DOL equivalence problem
• Language-theoretic aspects of DNA complementarity
• TOL schemes and control sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item