Splicing in abstract families of languages

DOI10.1016/S0304-3975(98)00046-2zbMath0944.68092WikidataQ126438928 ScholiaQ126438928MaRDI QIDQ1575672

Dennis Pixton

Publication date: 21 August 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

splicingH scheme

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (12)

On the splicing operation ⋮ Recognizing splicing languages: syntactic monoids and simultaneous pumping ⋮ Conjugate word blending: formal model and experimental implementation by XPCR ⋮ Template-guided DNA recombination ⋮ Formal properties of PA-matching ⋮ On the regularity of circular splicing languages: a survey and new developments ⋮ DNA Splicing Systems ⋮ Cut, paste and filter. ⋮ Splicing representations of stricly locally testable languages ⋮ A characterization of regular circular languages generated by marked splicing systems ⋮ On the power of circular splicing ⋮ Topics in the theory of DNA computing.

Cites Work

• Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
• Splicing semigroups of dominoes and DNA
• DNA computing: Arrival of biological mathematics
• On the splicing operation
• Regularity of splicing languages
• Splicing systems and regularity
• Computational Modeling for Genetic Splicing Systems
• On the power of the splicing operation¹
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Splicing in abstract families of languages