On the splicing operation

DOI10.1016/0166-218X(96)00101-1zbMath0855.68051OpenAlexW2144620949MaRDI QIDQ1923595

Gheorghe Păun

Publication date: 14 January 1997

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(96)00101-1

zbMATH Keywords

Chomsky language familiessplicing operations

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Classical flows, reactions, etc. in chemistry (92E20)

Related Items (31)

Descriptional Complexity of Semi-simple Splicing Systems ⋮ Accepting splicing systems with permitting and forbidding words ⋮ Computing by splicing ⋮ Constants and label-equivalence: a decision procedure for reflexive regular splicing languages ⋮ DNA computing: Arrival of biological mathematics ⋮ Deciding whether a regular language is generated by a splicing system ⋮ Circular splicing and regularity ⋮ Regularity of splicing languages ⋮ Simple splicing systems ⋮ Networks of splicing processors: simulations between topologies ⋮ Small networks of polarized splicing processors are universal ⋮ Some wonders of a bio-computer-scientist ⋮ Conjugate word blending: formal model and experimental implementation by XPCR ⋮ Direct constructions of universal extended H systems. ⋮ Descriptional Complexity of Semi-Simple Splicing Systems ⋮ Living systems are dynamically stable by computing themselves at the quantum level ⋮ Splicing systems with targets are computationally universal ⋮ Regular splicing languages and subclasses ⋮ Linear splicing and syntactic monoid ⋮ Multiple splicing systems and the universal computability ⋮ The structure of reflexive regular splicing languages via Schützenberger constants ⋮ LANGUAGE FAMILIES DEFINED BY A CILIATE BIO-OPERATION: HIERARCHIES AND DECISION PROBLEMS ⋮ Polarization: a new communication protocol in networks of bio-inspired processors ⋮ Splicing on tree-like structures ⋮ Theory of tailor automata ⋮ A characterization of regular circular languages generated by marked splicing systems ⋮ Splicing in abstract families of languages ⋮ On the universality of Post and splicing systems ⋮ On the power of circular splicing ⋮ Matrix splicing system ⋮ Existence of constants in regular splicing languages

Cites Work

• Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
• Splicing semigroups of dominoes and DNA
• Splicing in abstract families of languages
• A characterization of strictly locally testable languages and its application to subsemigroups of a free semigroup
• Splicing systems and regularity
• Description of developmental languages using recurrence systems
• On the index of a context-free grammar and language
• An analog of a theorem about context-free languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the splicing operation