On the splicing operation

DOI10.1016/0166-218X(96)00101-1zbMath0855.68051MaRDI 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 families; splicing operations

Mathematics Subject Classification ID

68Q45: Formal languages and automata

92E20: Classical flows, reactions, etc. in chemistry

Related Items

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

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