A Connection Between Red-Green Turing Machines and Watson-Crick T0L Systems

DOI10.1007/978-3-319-23111-2_3zbMath1415.68076OpenAlexW2183199878MaRDI QIDQ2945877

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

Related Items (2)

\(5'\rightarrow 3'\) Watson-Crick automata languages-without sensing parameter ⋮ Circular Interval-valued Computers and Simulation of (Red-green) Turing Machines

Cites Work

• Unnamed Item
• Computation as an unbounded process
• On Chebyshev functions and Klee functions
• 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
• Bright hump solitons for the higher-order nonlinear Schrödinger equation in optical fibers
• Red–Green P Automata

This page was built for publication: A Connection Between Red-Green Turing Machines and Watson-Crick T0L Systems