Watson-Crick T0L Systems and Red-Green Register Machines

DOI10.3233/FI-2017-1578MaRDI QIDQ4601150zbMATH OpenOpenAlexFDO

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

Publication date 19 January 2018

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2017-1578

zbMATH Keywords

decidabilityexpressive powermembership problemred-green Turing machinesred-green register machinesWatson-Crick T0L systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Recommendations

• A connection between red-green Turing machines and Watson-Crick T0L systems
• scientific article; zbMATH DE number 1342112
• Reversible Watson-Crick automata
• scientific article; zbMATH DE number 2104767
• Parallel communicating Watson-Crick automata systems
• Universal computation with Watson-Crick D0L systems.
• Circular interval-valued computers and simulation of (red-green) Turing machines
• Watson-Crick (D)0L systems: a survey
• On the power of parallel communicating Watson-Crick automata systems
• Watson-Crick quantum finite automata

Cited in

(4)

• Watson-Crick (D)0L systems: a survey
• A connection between red-green Turing machines and Watson-Crick T0L systems
• Circular interval-valued computers and simulation of (red-green) Turing machines
• Networks of Watson-Crick D0L systems with communication by substrings

This page was built for publication: Watson-Crick T0L Systems and Red-Green Register Machines

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