Power and size of extended Watson-Crick \(L\) systems.
From MaRDI portal
Publication:1401185
DOI10.1016/S0304-3975(02)00074-9zbMath1038.68075MaRDI QIDQ1401185
Erzsébet Csuhaj-Varjú, Judit Csima, Arto Salomaa
Publication date: 17 August 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Lindenmayer systems; Watson-Crick complementarity; Iterated morphism; \(D0L\) systems; Recursively enumerable language
68Q45: Formal languages and automata
Related Items
Extended Watson-Crick L systems with regular trigger languages and restricted derivation modes, Decidability results for Watson-Crick D0L systems with nonregular triggers., Watson-Crick D0L systems: Generative power and undecidable problems., A Connection Between Red-Green Turing Machines and Watson-Crick T0L Systems, On Some Biologically Motivated Control Devices for Parallel Rewriting
Cites Work