Extended Watson-Crick L systems with regular trigger languages and restricted derivation modes

DOI10.1007/S11047-012-9329-6MaRDI QIDQ256437zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

computational powerDNA computingE0L systemsLindenmayer systemsrecursively enumerable languageWatson-Crick complementarity

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Extended Watson-Crick L Systems with Regular Trigger Languages
• Power and size of extended Watson-Crick L systems.
• Uni-transitional Watson-Crick D0L systems
• From Watson-Crick L systems to Darwinian P systems
• Watson-Crick D0L systems with regular triggers

Cites work

• A Purely Homomorphic Characterization of Recursively Enumerable Sets
• Computing by networks of standard Watson-Crick D0L systems
• scientific article; zbMATH DE number 3174044 (Why is no real title available?)
• scientific article; zbMATH DE number 1189114 (Why is no real title available?)
• scientific article; zbMATH DE number 1064111 (Why is no real title available?)
• scientific article; zbMATH DE number 1738672 (Why is no real title available?)
• scientific article; zbMATH DE number 3802813 (Why is no real title available?)
• Language-theoretic aspects of DNA complementarity
• One-sided and two-sided context in formal grammars
• Power and size of extended Watson-Crick L systems.
• Theory Is Forever
• Uni-transitional Watson-Crick D0L systems
• Universal computation with Watson-Crick D0L systems.
• Watson-Crick D0L systems with regular triggers
• Watson-Crick walks and roads on D0L Graphs

Cited in

(7)

• Watson-Crick D0L systems: Generative power and undecidable problems.
• Universal computation with Watson-Crick D0L systems.
• A connection between red-green Turing machines and Watson-Crick T0L systems
• Extended Watson-Crick L Systems with Regular Trigger Languages
• 5' 3' Watson-Crick automata languages-without sensing parameter
• Networks of Watson-Crick D0L systems with communication by substrings
• Watson-Crick (D)0L systems: a survey

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)