An Algebraic Characterization of Semi-Simple Splicing

• Autorzy: Ceterchi, R.
• Języki publikacji: EN

Abstrakty

EN

An algebraic characterization of simple splicing languages given in [6] is extended to semi-simple splicing languages

Słowa kluczowe

EN

DNA computing; splicing; algebraic characterization

• Czasopismo: Fundamenta Informaticae
• Rocznik: 2006
• Tom: Vol. 73, nr 1-2
• Strony: 19-25
• Opis fizyczny: bibliogr. 8 poz.

Twórcy

autor

Ceterchi, R.

• Faculty of Mathematics, Bucharest University, Str. Academiei 14, RO-010014 Bucharest, Romania,

Bibliografia

• [1] R. Ceterchi, C. Martin-Vide, K.G. Subramanian: On some classes of splicing languages. In Aspects of Molecular Computing (N. Jonoska, Gh. P˘aun, G. Rozenberg, eds.), LNCS 2950, Springer-Verlag, Berlin, 2004, 84-105
• [2] J.S. Golan: The Theory of Semirings with Applications in Mathematics and Theoretical Computer Science. Longman Scientific and Technical, 1994.
• [3] E. Goode, D. Pixton: Semi-simple splicing systems. In Where Mathematics, Computer Science, Linguistics and Biology Meet (C. Mart´ın-Vide, V. Mitrana, eds.) Kluwer Academic Publ., Dordrecht, 2001, 343-352.
• [4] T. Head: Formal language theory and DNA. An analysis of the generative capacity of specific recombinant behavior. Bull. Math. Biol., 49 (1987), 737-759.
• [5] T. Head, Gh. P˘aun, D. Pixton: Language theory and molecular genetics: Generative mechanisms suggested by DNA recombination. In Handbook of Formal Languages (G. Rozenberg, A Salomaa, eds.), Springer-Verlag, Berlin, Vol. 2, 1997, 295-360.
• [6] A. Mateescu, Gh. Pǎun, G. Rozenberg, A. Salomaa: Simple splicing systems. Discrete Applied Math., 84 (1998), 145-163.
• [7] Gh. Pǎun, G. Rozenberg, A. Salomaa: DNA Computing. New Computing Paradigms. Springer-Verlag, Berlin, 1998.
• [8] D. Pixton: Regularity of splicing languages. Discrete Applied Math., 69 (1996), 101-124.