Extended Watson-Crick L systems with regular trigger languages and restricted derivation modes
From MaRDI portal
Publication:256437
DOI10.1007/S11047-012-9329-6zbMATH Open1331.68139OpenAlexW2031426449MaRDI QIDQ256437FDOQ256437
Authors: David Sears, Kai Salomaa 
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
Recommendations
computational powerDNA computingE0L systemsLindenmayer systemsrecursively enumerable languageWatson-Crick complementarity
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.
- Watson-Crick walks and roads on D0L Graphs
- Computing by networks of standard Watson-Crick D0L systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Purely Homomorphic Characterization of Recursively Enumerable Sets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- One-sided and two-sided context in formal grammars
- Theory Is Forever
- Watson-Crick D0L systems with regular triggers
Cited In (7)
- Watson-Crick (D)0L systems: a survey
- Watson-Crick D0L systems: Generative power and undecidable problems.
- A connection between red-green Turing machines and Watson-Crick T0L systems
- \(5'\rightarrow 3'\) Watson-Crick automata languages-without sensing parameter
- Universal computation with Watson-Crick D0L systems.
- Networks of Watson-Crick D0L systems with communication by substrings
- Extended Watson-Crick L Systems with Regular Trigger Languages
This page was built for publication: Extended Watson-Crick L systems with regular trigger languages and restricted derivation modes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q256437)
