On the universality of Post and splicing systems
From MaRDI portal
Publication:1575914
DOI10.1016/S0304-3975(99)00097-3zbMath0951.68034OpenAlexW2127688334WikidataQ57518652 ScholiaQ57518652MaRDI QIDQ1575914
Publication date: 23 August 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(99)00097-3
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
Small Universal Devices ⋮ Direct constructions of universal extended H systems. ⋮ Splicing systems with targets are computationally universal
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
- Splicing semigroups of dominoes and DNA
- DNA computing based on splicing: The existence of universal computers
- On the splicing operation
- Regularity of splicing languages
- Splicing systems and regularity
- Formal Reductions of the General Combinatorial Decision Problem
This page was built for publication: On the universality of Post and splicing systems
