Splicing in abstract families of languages
From MaRDI portal
Publication:1575672
DOI10.1016/S0304-3975(98)00046-2zbMath0944.68092MaRDI QIDQ1575672
Publication date: 21 August 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
68Q45: Formal languages and automata
Related Items
DNA Splicing Systems, Formal properties of PA-matching, On the regularity of circular splicing languages: a survey and new developments, Recognizing splicing languages: syntactic monoids and simultaneous pumping, A characterization of regular circular languages generated by marked splicing systems, Splicing representations of stricly locally testable languages, Template-guided DNA recombination, Cut, paste and filter., Topics in the theory of DNA computing., On the splicing operation, On the power of circular splicing
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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 operation1