Networks of Watson-Crick D0L systems with communication by substrings
From MaRDI portal
Publication:6204551
Recommendations
Cites work
- scientific article; zbMATH DE number 1189114 (Why is no real title available?)
- scientific article; zbMATH DE number 1236223 (Why is no real title available?)
- scientific article; zbMATH DE number 1064111 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- Aspects of Molecular Computing
- Computing by networks of standard Watson-Crick D0L systems
- Extended Watson-Crick L systems with regular trigger languages and restricted derivation modes
- ITERATED MORPHISMS WITH COMPLEMENTARITY ON THE DNA ALPHABET
- Language-theoretic aspects of DNA complementarity
- Normal forms for phrase-structure 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 D0L systems: Generative power and undecidable problems.
- Watson-Crick D0L systems: The power of one transition
- Watson-Crick T0L Systems and Red-Green Register Machines
- Watson-Crick walks and roads on D0L Graphs
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)