Small Universal Devices

DOI10.1007/978-3-319-13350-8_19zbMath1323.68268OpenAlexW74407118MaRDI QIDQ2944894

Sergey Verlan, Artiom Alhazov, Yurii Rogozhin

Publication date: 8 September 2015

Published in: Computing with New Resources (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-13350-8_19

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimization strategies for maximally parallel multiset rewriting systems
• Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
• Small universal Turing machines
• Small universal register machines
• DNA computing: Arrival of biological mathematics
• Nine universal circular Post machines
• Direct constructions of universal extended H systems.
• Frontier between decidability and undecidability: A survey
• On the universality of Post and splicing systems
• Computing with membranes
• Membrane computing. An introduction.
• P systems based on tag operations
• The Complexity of Small Universal Turing Machines: A Survey
• SMALL UNIVERSAL TVDH AND TEST TUBE SYSTEMS
• P Systems with Toxic Objects
• On the Power of Networks of Evolutionary Processors
• ON SMALL UNIVERSAL SPLICING SYSTEMS
• TIME-VARYING DISTRIBUTED H SYSTEMS OF DEGREE 1 GENERATE ALL RECURSIVELY ENUMERABLE LANGUAGES
• Small Universal Non-deterministic Petri Nets with Inhibitor Arcs
• Universality of Tag Systems with P = 2
• 5-Symbol 8-State and 5-Symbol 6-State Universal Turing Machines
• DNA Computing
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Formal Reductions of the General Combinatorial Decision Problem
• Membrane Computing
• Four Small Universal Turing Machines