Networks of Watson-Crick D0L systems with communication by substrings

DOI10.1016/j.tcs.2024.114493OpenAlexW4392716409MaRDI QIDQ6204551

György Vaszil, Erzsébet Csuhaj-Varjú

Publication date: 28 March 2024

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2024.114493

zbMATH Keywords

DNA computingrecursively enumerable languagesWatson-Crick D0L systemnetworks of Watson-Crick D0L systems

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Extended Watson-Crick L systems with regular trigger languages and restricted derivation modes
• Watson-Crick D0L systems: The power of one transition
• Power and size of extended Watson-Crick \(L\) systems.
• Watson-Crick D0L systems: Generative power and undecidable problems.
• Language-theoretic aspects of DNA complementarity
• Uni-transitional Watson-Crick D0L systems
• Universal computation with Watson-Crick D0L systems.
• Normal forms for phrase-structure grammars
• Watson-Crick T0L Systems and Red-Green Register Machines
• ITERATED MORPHISMS WITH COMPLEMENTARITY ON THE DNA ALPHABET
• Theory Is Forever
• Aspects of Molecular Computing
• Watson-Crick D0L systems with regular triggers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Networks of Watson-Crick D0L systems with communication by substrings