Splicing Systems: Accepting Versus Generating

DOI10.1007/978-3-642-21875-0_5zbMath1345.68127OpenAlexW1767485317MaRDI QIDQ3091439

Juan Castellanos, Victor Mitrana, Eugenio Santos

Publication date: 9 September 2011

Published in: Models of Computation in Context (Search for Journal in Brave)

Full work available at URL: http://oa.upm.es/21114/

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45)

Related Items

Networks of splicing processors: simulations between topologies

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• DNA splicing: Computing by observing
• Accepting splicing systems
• 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: Splicing Systems: Accepting Versus Generating