Computing by splicing

DOI10.1016/S0304-3975(96)00082-5zbMath0874.68117MaRDI QIDQ1349864

Grzegorz Rozenberg, Arto Salomaa, Gheorghe Păun

Publication date: 27 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(96)00082-5

Mathematics Subject Classification ID

68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)

Related Items

Unnamed Item, Non-preserving splicing with delay, Multiple splicing systems and the universal computability, Matrix splicing system, Commutator algebras arising from splicing operations, Splicing systems with targets are computationally universal, Accepting splicing systems, Splicing representations of stricly locally testable languages, Splicing on tree-like structures, Sticker systems, DNA computing based on splicing: Universality results, Frontier between decidability and undecidability: A survey, Separating some splicing models., Topics in the theory of DNA computing., Time and space complexity for splicing systems, Accepting splicing systems with permitting and forbidding words, Complexity theory for splicing systems, Simulating R Systems by P Systems, Splicing Systems: Accepting Versus Generating, Defining Languages by Forbidding-Enforcing Systems, DESCRIPTIONAL COMPLEXITY OF SPLICING SYSTEMS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The family of one-counter languages is closed under quotient
• Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
• Splicing semigroups of dominoes and DNA
• Simple splicing systems
• On the splicing operation
• Splicing systems and regularity
• On the power of the splicing operation¹