Accepting splicing systems with permitting and forbidding words

DOI10.1007/S00236-012-0169-8zbMATH Open1281.68106OpenAlexW2040132350MaRDI QIDQ2376984FDOQ2376984

Authors: Fernando Arroyo, Juan Castellanos, Victor Mitrana, Jose Ramon Sanchez Couso, Jürgen 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/

Recommendations

• Splicing systems: accepting versus generating
• Accepting splicing systems
• Non-preserving accepting splicing systems
• Computing by splicing
• scientific article; zbMATH DE number 1004368

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
• Title not available (Why is that?)
• Splicing semigroups of dominoes and DNA
• On the splicing operation
• Regularity of splicing languages
• Computing by splicing
• DNA computing based on splicing: The existence of universal computers
• Title not available (Why is that?)
• Title not available (Why is that?)
• Accepting splicing systems
• Non-context-free grammars generating context-free languages
• A helpful result for proving inherent ambiguity
• DNA splicing: Computing by observing
• Regular splicing languages and subclasses
• DESCRIPTIONAL COMPLEXITY OF SPLICING SYSTEMS

Cited In (5)

• Accepting \(H\) iso-array system
• Non-preserving accepting splicing systems
• Accepting splicing systems
• Networks of splicing processors: simulations between topologies
• Splicing systems: accepting versus generating

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2376984)