Accepting splicing systems
From MaRDI portal
Publication:974105
DOI10.1016/j.tcs.2010.03.025zbMath1207.68196OpenAlexW1990671079MaRDI QIDQ974105
Victor Mitrana, Ion Petre, Vladimir Rogozhin
Publication date: 27 May 2010
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.03.025
Related Items
Accepting splicing systems with permitting and forbidding words ⋮ Networks of splicing processors: simulations between topologies ⋮ Unnamed Item ⋮ Accepting networks of genetic processors are computationally complete ⋮ Splicing Systems: Accepting Versus Generating
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- DNA splicing: Computing by observing
- 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
- Computing by splicing
- Regularity of splicing languages
- Regular splicing languages and subclasses
- DESCRIPTIONAL COMPLEXITY OF SPLICING SYSTEMS
This page was built for publication: Accepting splicing systems