Abstract
The main goal of this work is to formally describe splicing systems. This is a necessary step to subsequently apply Christiansen Grammar Evolution (an evolutionary tool developed by the authors) for automatic designing of splicing systems. Their large number of variants suggests us a decisions: to select a family as simple as possible of splicing systems equivalent to Turing machines. This property ensures that the kind of systems our grammar can generate is able to solve any arbitrary problem. Some components of these universal splicing systems depend on other components. So, a formal representation able to handle context dependent constructions is needed. Our work uses Christiansen grammars to describe splicing systems.
This work was partially supported by DGUI CAM/UAM, project CCG08-UAM/TIC-4425.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Christiansen, H.: A Survey of Adaptable Grammars. In: ACM SIGPLAN Notices, November 1990, vol. 25(11), pp. 35–44 (1990)
Chomsky, A.N.: Formal properties of grammars. In: Handbook of Math. Psych., vol. 2, pp. 323–418. John Wiley and Sons, New York (1963)
Abu, D.A.L., Ortega, A., Alfonseca, M.: Cellular Automata equivalent to PD0L Systems. In: International Arab Conference on Information Technology (ACIT 2003), Alexandria, Egipto. Pub: Proceedings, December 20-23, pp. 819–825 (2003)
Abu, D.A.L., Ortega, A., Alfonseca, M.: Cellular Automata equivalent to D0L Systems. In: 3rd WSEAS International Conference on Systems Theory and Scientific Computation, Special Session on Cellular Automata and Applications, Rodas, Grecia. Pub: Proceedings en CDROM, November 15-17 (2003)
Head, T.: Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviors. Bull. Math. Biology 49, 737–759 (1987)
Head, T.: Splicing schemes and DNA. In: Rozenberg, G., Salomaa, A. (eds.) Lindenmayer Systems; Zmpacts on Theoretical Computer Science and Developmental Biology, pp. 371–383. Springer, Berlin (1992)
Knuth, D.E.: Semantics of Context-Free Languages. Mathematical Systems Theory 2(2), 127–145 (1968)
Ortega, A., Dalhoum, A.A., Alfonseca, M.: Grammatical evolution to design fractal curves with a given dimension. IBM Jr. of Res. and Dev. (SCI JCR 2.560) 47(4), 483–493 (2003)
Ortega, A., Abu, D.A.L., Alfonseca, M.: Cellular Automata equivalent to DIL Systems. In: 5th Middle East Symposium on Simulation and Modelling (MESM 2003), Eurosim, 5-7 Ene. 2004, Sharjah, Emiratos Arabes Unidos. Pub: Proceedings, pp. 120–124 (2003) ISBN: 90-77381-06-6
Ortega, A., Cruz Echeandía, M., Alfonseca, M.: Christiansen Grammar Evolution: grammatical evolution with semantic (in press)
Păun, G.: Regular extended H systems are computationally universal. Journal of Automata, Languages, Combinatorics 1(1), 27–36 (1996)
Shutt, J.N.: Recursive Adaptable Grammars. A thesis submitted to the Faculty of the Worcester Polytechnic Institute in partial fulfillment of the requirements for the degree of Master of Science in Computer Science, August 10 (1993) (emended December 16, 2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
de la Cruz Echeandía, M., de la Puente, A.O. (2009). A Christiansen Grammar for Universal Splicing Systems. In: Mira, J., Ferrández, J.M., Álvarez, J.R., de la Paz, F., Toledo, F.J. (eds) Methods and Models in Artificial and Natural Computation. A Homage to Professor Mira’s Scientific Legacy. IWINAC 2009. Lecture Notes in Computer Science, vol 5601. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02264-7_35
Download citation
DOI: https://doi.org/10.1007/978-3-642-02264-7_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02263-0
Online ISBN: 978-3-642-02264-7
eBook Packages: Computer ScienceComputer Science (R0)