Linear and circular splicing systems
- 19 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 181-188
- https://doi.org/10.1109/inbs.1995.404263
Abstract
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.Keywords
This publication has 4 references indexed in Scilit:
- On the splicing operationDiscrete Applied Mathematics, 1996
- Circular DNA and splicing systemsPublished by Springer Nature ,1992
- Splicing semigroups of dominoes and DNADiscrete Applied Mathematics, 1991
- Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviorsBulletin of Mathematical Biology, 1987