Multiple splicing systems and the universal computability
From MaRDI portal
Publication:5941559
DOI10.1016/S0304-3975(00)00211-5zbMath0972.68087MaRDI QIDQ5941559
Yasubumi Sakakibara, Satoshi Kobayashi
Publication date: 20 August 2001
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
- DNA computing based on splicing: The existence of universal computers
- Prefix grammars: An alternative characterization of the regular languages
- Computing by splicing
- On the splicing operation
- Regularity of splicing languages
- Monadic Elementary Formal Systems
- Formal Reductions of the General Combinatorial Decision Problem
This page was built for publication: Multiple splicing systems and the universal computability
