Splicing semigroups of dominoes and DNA
Discrete Mathematics
Finite automata, formal logic, and circuit complexity
Finite automata, formal logic, and circuit complexity
Regularity of splicing languages
Discrete Applied Mathematics
Language theory and molecular genetics: generative mechanisms suggested by DNA recombination
Handbook of formal languages, vol. 2
Discrete Applied Mathematics
Splicing representations of strictly locally testable languages
Discrete Applied Mathematics
Where mathematics, computer science, linguistics and biology meet
Varieties Of Formal Languages
Dominoes and the Regularity of DNS Splicing Languages
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Counter-Free Automata (M.I.T. research monograph no. 65)
Counter-Free Automata (M.I.T. research monograph no. 65)
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
Decision problems for linear and circular splicing systems
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Journal of Computer Science and Technology - Special issue on bioinformatics
An alternative definition of splicing
Theoretical Computer Science
Recognizing splicing languages: Syntactic monoids and simultaneous pumping
Discrete Applied Mathematics
Decision problems for linear and circular splicing systems
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Fuzzy molecular automaton using splicing theory
International Journal of Bio-Inspired Computation
| Hi-index | 0.00 |
The motivation for the development of splicing theory is recalled. Attention is restricted to finite splicing systems, which are those having only finitely many rules and finitely many initial strings. Languages generated by such systems are necessarily regular, but not all regular languages can be so generated. The splicing systems that arose originally, as models of enzymatic actions, have two special properties called reflexivity and symmetry. We announce the Pixton-Goode procedure for deciding whether a given regular language can be generated by a finite reflexive splicing system. Although the correctness of the algorithm is not demonstrated here, two propositions that serve as major tools in the demonstration are stated. One of these is a powerful pumping lemma. The concept of the syntactic monoid of a language provides sharp conceptual clarity in this area. We believe that there may be yet unrealized results to be found that interweave splicing theory with subclasses of the class of regular languages and we invite others to join in these investigations.