Title :
Linear and circular splicing systems
Author_Institution :
Dept. of Math. Sci., State Univ. of New York, Binghamton, NY, USA
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 :
formal languages; set theory; circular splicing systems; context-free languages; cyclic permutations; full abstract families; iterated splicing; linear splicing systems; regular languages; Biochemistry; DNA; Splicing; Visualization;
Conference_Titel :
Intelligence in Neural and Biological Systems, 1995. INBS'95, Proceedings., First International Symposium on
Conference_Location :
Herndon, VA
Print_ISBN :
0-8186-7116-5
DOI :
10.1109/INBS.1995.404263
