Splicing semigroups of dominoes and DNA
Discrete Mathematics
Handbook of theoretical computer science (vol. B)
Algorithms for splicing systems
SIAM Journal on Computing
Regularity of splicing languages
Discrete Applied Mathematics
Discrete Applied Mathematics
Theoretical Computer Science - Special issue on universal machines and computations
Regular extended H systems are computationally universal
Journal of Automata, Languages and Combinatorics
Computational Modeling for Genetic Splicing Systems
SIAM Journal on Computing
Handbook of formal languages, vol. 1
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
Splicing in abstract families of languages
Theoretical Computer Science
Where mathematics, computer science, linguistics and biology meet
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
Separating some splicing models
Information Processing Letters
Theory of Codes
Circular DNA and Splicing Systems
ICPIA '92 Proceedings of the Second International Conference on Parallel Image Analysis
An Algorithm for Identifying Spliced Languages
COCOON '97 Proceedings of the Third Annual International Conference on Computing and Combinatorics
Splicing Systems: Regularity and Below
DNA8 Revised Papers from the 8th International Workshop on DNA Based Computers: DNA Computing
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)
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)
Splicing Systems: Regularity and Below
DNA8 Revised Papers from the 8th International Workshop on DNA Based Computers: DNA Computing
The structure of reflexive regular splicing languages via Schützenberger constants
Theoretical Computer Science
Regular splicing languages and subclasses
Theoretical Computer Science - The art of theory
Linear splicing and syntactic monoid
Discrete Applied Mathematics
On the power of circular splicing
Discrete Applied Mathematics - Special issue: Max-algebra
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
On the power of circular splicing
Discrete Applied Mathematics
Linear splicing and syntactic monoid
Discrete Applied Mathematics
Regular languages generated by reflexive finite splicing systems
DLT'03 Proceedings of the 7th international conference on Developments in language theory
On the regularity of circular splicing languages: a survey and new developments
Natural Computing: an international journal
A characterization of (regular) circular languages generated by monotone complete splicing systems
Theoretical Computer Science
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
Splicing systems and the Chomsky hierarchy
Theoretical Computer Science
Marked systems and circular splicing
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
| Hi-index | 0.00 |
We will consider here the splicing systems, generative devices inspired by cut and paste phenomena on DNA molecules under the action of restriction and ligase enzymes. A DNA strand can be viewed as a string over a four letter alphabet (the four deoxyribonucleotides), therefore we can model DNA computation within the framework of formal language theory. In spite of a vast literature on splicing systems, briefly surveyed here, a few problems related to their computational power are still open. We intend to evidence how classical techniques and concepts in automata theory are a legitimate tool for investigating some of these problems.