Abstract
We introduce some classes of splicing languages generated with simple and semi-simple splicing rules, in both, the linear and circular cases. We investigate some of their properties.
This work was possible thanks to the grants SAB2000-0145, and SAB2001-0007, from the SecretarÃa de Estado de Educación y Universidades, Spanish Ministry for Education, Culture and Sport.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bonizzoni, P., De Felice, C., Mauri, G., Zizza, R.: DNA and Circular Splicing. In: Condon, A., Rozenberg, G. (eds.) DNA 2000. LNCS, vol. 2054, pp. 117–129. Springer, Heidelberg (2001)
Bonizzoni, P., De Felice, C., Mauri, G., Zizza, R.: Circular Splicing and Regularity (2002) (submitted)
Bonizzoni, P., De Felice, C., Mauri, G., Zizza, R.: Decision Problems for Linear and Circular Splicing Systems. In: Ito, M., Toyama, M. (eds.) DLT 2002. LNCS, vol. 2450, pp. 78–92. Springer, Heidelberg (2003)
Bonizzoni, P., Ferreti, C., Mauri, G., Zizza, R.: Separating Some Splicing Models. Information Processing Letters 79(6), 255–259 (2001)
Ceterchi, R., Subramanian, K.G.: Simple Circular Splicing Systems (2003) (to appear ROMJIST 2003)
Culik, K., Harju, T.: Splicing Semigroups of Dominoes and DNA. Discrete Applied Mathematics 31, 261–277 (1991)
DeLuca, A., Restivo, A.: A Characterization of Strictly Locally Testable Languages and Its Application to Subsemigroups of a Free Semigroup. Information and Control 44, 300–319 (1980)
Goode, E., Pixton, D.: Semi-simple Splicing Systems. In: MartÃn-Vide, C., Mitrana, V. (eds.) Where Mathematics, Computer Science, Linguistics and Biology Meet, pp. 343–352. Kluwer Academic Publ., Dordrecht (2001)
Head, T.: Formal Language Theory and DNA: an Analysis of the Generative Capacity of Specific Recombinant Behavior. Bull. Math. Biol. 49, 737–759 (1987)
Head, T.: Splicing Representations of Strictly Locally Testable Languages. Discrete Applied Math. 87, 139–147 (1998)
Head, T., Păun, G., Pixton, D.: Language Theory and Molecular Genetics: generative Mechanisms Suggested by DNA Recombination. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 2, pp. 295–360. Springer, Heidelberg (1997)
Mateescu, P.G., Rozenberg, G., Salomaa, A.: Simple Splicing Systems, Discrete. Applied Math. 84, 145–163 (1998)
Păun, G.: On the Splicing Operation. Discrete Applied Math. 70, 57–79 (1996)
Păun, G., Rozenberg, G., Salomaa, A.: DNA Computing. New Computing Paradigms. Springer, Berlin (1998)
Pixton, D.: Regularity of Splicing Languages. Discrete Applied Math. 69, 101–124 (1996)
Schützenberger, M.P.: Surcertaines operations de fermeture dans les langages rationnels. Symposia Math. 15, 245–253 (1975)
Siromoney, R., Subramanian, K.G., Dare, V.R.: Circular DNA and Splicing Systems. In: Proc. of ICPIA. LNCS, vol. 654, pp. 260–273. Springer, Berlin (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Ceterchi, R., MartÃn-Vide, C., Subramanian, K.G. (2003). On Some Classes of Splicing Languages. In: Jonoska, N., Păun, G., Rozenberg, G. (eds) Aspects of Molecular Computing. Lecture Notes in Computer Science, vol 2950. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24635-0_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-24635-0_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20781-8
Online ISBN: 978-3-540-24635-0
eBook Packages: Springer Book Archive