Networks of Watson-Crick D0L systems with communication by substrings
From MaRDI portal
Publication:6204551
DOI10.1016/J.TCS.2024.114493OpenAlexW4392716409MaRDI QIDQ6204551FDOQ6204551
Authors: Erzsébet Csuhaj-Varjú, György Vaszil
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
Recommendations
DNA computingrecursively enumerable languagesWatson-Crick D0L systemnetworks of Watson-Crick D0L systems
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.
- Extended Watson-Crick L systems with regular trigger languages and restricted derivation modes
- Watson-Crick walks and roads on D0L Graphs
- Computing by networks of standard Watson-Crick D0L systems
- Title not available (Why is that?)
- Normal forms for phrase-structure grammars
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Theory Is Forever
- Watson-Crick D0L systems with regular triggers
- ITERATED MORPHISMS WITH COMPLEMENTARITY ON THE DNA ALPHABET
- Watson-Crick D0L systems: The power of one transition
- Watson-Crick D0L systems: Generative power and undecidable problems.
- Aspects of Molecular Computing
- Watson-Crick T0L Systems and Red-Green Register Machines
This page was built for publication: Networks of Watson-Crick D0L systems with communication by substrings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6204551)