Accepting splicing systems with permitting and forbidding words

DOI10.1007/s00236-012-0169-8zbMath1281.68106OpenAlexW2040132350MaRDI QIDQ2376984

Fernando Arroyo, Juan Castellanos, Victor Mitrana, Jose Ramon Sanchez Couso, Juergen Dassow

Publication date: 26 June 2013

Published in: Acta Informatica (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

Networks of splicing processors: simulations between topologies ⋮ Unnamed Item

Cites Work

• 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
• On the splicing operation
• Regularity of splicing languages
• Regular splicing languages and subclasses
• DESCRIPTIONAL COMPLEXITY OF SPLICING SYSTEMS
• Non-context-free grammars generating context-free languages
• A helpful result for proving inherent ambiguity
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Accepting splicing systems with permitting and forbidding words