Splicing semigroups of dominoes and DNA
Discrete Mathematics
Regularity of splicing languages
Discrete Applied Mathematics
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Circular DNA and Splicing Systems
ICPIA '92 Proceedings of the Second International Conference on Parallel Image Analysis
Molecular computing paradigm – toward freedom from Turing's charm
Natural Computing: an international journal
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
The structure of reflexive regular splicing languages via Schützenberger constants
Theoretical Computer Science
A characterization of regular circular languages generated by marked splicing systems
Theoretical Computer Science
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
DNA splicing systems: an ordinary differential equations model and simulation
DNA13'07 Proceedings of the 13th international conference on DNA computing
On the regularity of circular splicing languages: a survey and new developments
Natural Computing: an international journal
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 |
Considers closure properties of classes of languages under the operation of iterated splicing. The main result is that full abstract families of languages are closed under splicing using a regular set of splicing rules. The author has the same result for families of circular strings, with two extra assumptions: the languages in the abstract family must be closed under cyclic permutations and the splicing scheme must be reflective. In both cases the hypotheses are satisfied by the families of regular languages and of context-free languages.