Molecular computing paradigm – toward freedom from Turing's charm
Natural Computing: an international journal
DNA '00 Revised Papers from the 6th 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
Linear splicing and syntactic monoid
Discrete Applied Mathematics
Decision problems for linear and circular splicing systems
DLT'02 Proceedings of the 6th 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 | 0.00 |
A genetic splicing system involves DNA molecules mixed with enzymes and a ligase that allow the molecules to be cleaved and recombined to produce other molecules in addition to the original ones. Recently, using formal language theory, several researchers have investigated the string properties of DNA molecules that may potentially arise from the original set of molecules under the effect of the given restriction enzymes.This paper introduces an algorithm which, given a splicing system whose initial set of strings is regular, constructs a finite state automaton that recognizes the set of DNA molecules spliced by the system. This algorithm solves the open problem of constructing such an automaton and shows a direct approach to the proof of regularity of spliced languages.