Power and size of extended Watson-Crick \(L\) systems.

DOI10.1016/S0304-3975(02)00074-9zbMath1038.68075OpenAlexW1987209359MaRDI QIDQ1401185

Erzsébet Csuhaj-Varjú, Judit Csima, Arto Salomaa

Publication date: 17 August 2003

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00074-9

zbMATH Keywords

Lindenmayer systemsWatson-Crick complementarityIterated morphism\(D0L\) systemsRecursively enumerable language

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (6)

A Connection Between Red-Green Turing Machines and Watson-Crick T0L 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 ⋮ Extended Watson-Crick L systems with regular trigger languages and restricted derivation modes

Cites Work

• Language-theoretic aspects of DNA complementarity
• Uni-transitional Watson-Crick D0L systems
• Aspects of Molecular Computing
• Watson-Crick D0L systems with regular triggers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Power and size of extended Watson-Crick \(L\) systems.