Searching for "Regularity of Splicing Languages." – sorted by Relevance.
-
Regularity of Splicing Languages
- Regularity of Splicing Languages Dennis Pixton* Department of Mathematical Sciences State
- Cited by 31 (2 self) – Add To MetaCart
-
Computational Modeling for Genetic Splicing Systems
- approach to the proof of regularity of spliced languages. Key words. finite state automata, languages
- Cited by 1 (0 self) – Add To MetaCart
-
Linear and Circular Splicing Systems
- result is that full abstract families of languages are closed under splicing using a regular set
- Cited by 9 (0 self) – Add To MetaCart
-
Splicing Semigroups of Dominoes and DNA
- ] was that the splicing language is a strictly locally testable regular set in the restricted case of the persistent
- Cited by 10 (0 self) – Add To MetaCart
-
Semi-simple Splicing Systems
- produce a regular splicing language ([1], [13]), but not all regular languages can be generated
- Add To MetaCart

