Extended Watson-Crick L systems with regular trigger languages and restricted derivation modes
From MaRDI portal
Publication:256437
DOI10.1007/s11047-012-9329-6zbMath1331.68139OpenAlexW2031426449MaRDI QIDQ256437
Publication date: 9 March 2016
Published in: Natural Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11047-012-9329-6
DNA computingLindenmayer systemsWatson-Crick complementaritycomputational powerE0L systemsrecursively enumerable language
Related Items
\(5'\rightarrow 3'\) Watson-Crick automata languages-without sensing parameter, Networks of Watson-Crick D0L systems with communication by substrings
Cites Work
- Power and size of extended Watson-Crick \(L\) systems.
- Language-theoretic aspects of DNA complementarity
- Uni-transitional Watson-Crick D0L systems
- Universal computation with Watson-Crick D0L systems.
- A Purely Homomorphic Characterization of Recursively Enumerable Sets
- One-sided and two-sided context in formal grammars
- Theory Is Forever
- Watson-Crick D0L systems with regular triggers
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item