Computing by splicing
From MaRDI portal
Publication:1349864
DOI10.1016/S0304-3975(96)00082-5zbMath0874.68117OpenAlexW2084129848MaRDI 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
Related Items (21)
Accepting splicing systems with permitting and forbidding words ⋮ Non-preserving splicing with delay ⋮ Commutator algebras arising from splicing operations ⋮ Simulating R Systems by P Systems ⋮ DESCRIPTIONAL COMPLEXITY OF SPLICING SYSTEMS ⋮ Time and space complexity for splicing systems ⋮ Complexity theory for splicing systems ⋮ Splicing systems with targets are computationally universal ⋮ Unnamed Item ⋮ Accepting splicing systems ⋮ Multiple splicing systems and the universal computability ⋮ Splicing Systems: Accepting Versus Generating ⋮ Defining Languages by Forbidding-Enforcing 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 ⋮ Matrix splicing system ⋮ Topics in the theory of DNA computing. ⋮ Separating some splicing models.
Cites Work
- 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 operation1
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Computing by splicing
