A connection between red-green Turing machines and Watson-Crick T0L systems

DOI10.1007/978-3-319-23111-2_3zbMATH Open1415.68076OpenAlexW2183199878MaRDI QIDQ2945877FDOQ2945877

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

Publication date 15 September 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-23111-2_3

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Grammars and rewriting systems (68Q42)

Recommendations

• Watson-Crick T0L Systems and Red-Green Register Machines
• scientific article; zbMATH DE number 1738672
• Extended Watson-Crick L Systems with Regular Trigger Languages
• Extended Watson-Crick L systems with regular trigger languages and restricted derivation modes
• scientific article; zbMATH DE number 1860696

Cites work

• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• Bright hump solitons for the higher-order nonlinear Schrödinger equation in optical fibers
• Computation as an unbounded process
• Language-theoretic aspects of DNA complementarity
• On Chebyshev functions and Klee functions
• Power and size of extended Watson-Crick \(L\) systems.
• Red–Green P Automata
• Uni-transitional Watson-Crick D0L systems
• Watson-Crick D0L systems: Generative power and undecidable problems.

Cited in

(3)

• Circular interval-valued computers and simulation of (red-green) Turing machines
• Watson-Crick T0L Systems and Red-Green Register Machines
• \(5'\rightarrow 3'\) Watson-Crick automata languages-without sensing parameter

This page was built for publication: A connection between red-green Turing machines and Watson-Crick T0L systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2945877)