Splicing semigroups of dominoes and DNA
Discrete Mathematics
Handbook of theoretical computer science (vol. B)
Regularity of splicing languages
Discrete Applied Mathematics
Discrete Applied Mathematics
Computational Modeling for Genetic Splicing Systems
SIAM Journal on Computing
Language theory and molecular genetics: generative mechanisms suggested by DNA recombination
Handbook of formal languages, vol. 2
Automata, Languages, and Machines
Automata, Languages, and Machines
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
Separating some splicing models
Information Processing Letters
Theory of Codes
Introduction to Formal Language Theory
Introduction to Formal Language Theory
An Algorithm for Identifying Spliced Languages
COCOON '97 Proceedings of the Third Annual International Conference on Computing and Combinatorics
Linear and circular splicing systems
INBS '95 Proceedings of the First International Symposium on Intelligence in Neural and Biological Systems (INBS'95)
Counter-Free Automata (M.I.T. research monograph no. 65)
Counter-Free Automata (M.I.T. research monograph no. 65)
Regular splicing languages and subclasses
Theoretical Computer Science - The art of theory
Decision problems for linear and circular splicing systems
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Regular languages generated by reflexive finite splicing systems
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Regular splicing languages and subclasses
Theoretical Computer Science - The art of theory
Linear splicing and syntactic monoid
Discrete Applied Mathematics
Recognizing splicing languages: Syntactic monoids and simultaneous pumping
Discrete Applied Mathematics
A characterization of regular circular languages generated by marked splicing systems
Theoretical Computer Science
Linear splicing and syntactic monoid
Discrete Applied Mathematics
Regular splicing languages must have a constant
DLT'11 Proceedings of the 15th international conference on Developments in language theory
A decision procedure for reflexive regular splicing languages
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Recombinant DNA ,gene splicing as generative devices of formal languages
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Hi-index | 5.23 |
The splicing operation was introduced in 1987 by Head as a mathematical model of the recombination of DNA molecules under the influence of restriction and ligases enzymes. This operation allows us to define a computing (language generating) device, called a splicing system. Other variants of this original definition were also proposed by Paun and Pixton respectively. The computational power of splicing systems has been thoroughly investigated. Nevertheless, an interesting problem is still open, namely the characterization of the class of regular languages generated by finite splicing systems. In this paper, we will solve the problem for a special class of finite splicing systems, termed reflexive splicing systems, according to each of the definitions of splicing given by Paun and Pixton. This special class of systems contains, in perticular, finite Head splicing systems. The notion of a constant, given by Schützenberger, once again intervenes.