Advertisement

Towards the Automatic Programming of H Systems: jHsys, a Java H System Simulator

  • J. M. Rojas Siles
  • M. de la Cruz Echeandía
  • A. Ortega de la Puente
Part of the Advances in Intelligent and Soft Computing book series (AINSC, volume 71)

Abstract

The main goal of this paper is to describe how we consider that splicing systems (a family of abstract bio-inspired computing devices) can be automatically programmed (designed) in the future. One of the necessary steps is to formally describe the computer being programmed (splicing systems). Some of the authors of this paper have previously solved this problem.Another necessary step is to develop a simulator forHsystems.We propose applying Christiansen Grammar Evolution (an evolutionary automatic programming algorithm developed by the authors) to complete the process. This technique includes a fitness function that the simulator requires. This paper is devoted to describe jHSys, a Java simulator for splicing (H) systems.

Keywords

Cellular Automaton Computing Device Turing Machine Automatic Program Grammatical Evolution 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    de la Cruz, M., Ortega, A.: 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.) IWINAC 2009. LNCS, vol. 5601, pp. 336–345. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  2. 2.
    Ortega, A., Dalhoum, A.A., Alfonseca, M.: Grammatical evolution to design fractal curves with a given dimension. IBM Jr. of Res. and Dev. 47(4), 483–493 (2003)CrossRefGoogle Scholar
  3. 3.
    Ortega, A., Abu, D.A.L., Alfonseca, M.: Cellular Automata equivalent to DIL Systems. In: Proceedings of 5th Middle East Symposium on Simulation and Modelling (MESM 2003), Eurosim, 5-7 Ene. 2004, pp. 120–124. Emiratos Arabes Unidos. Pub., Sharjah (2003) ISBN: 90-77381-06-6Google Scholar
  4. 4.
    Abu, D.A.L., Ortega, A., Alfonseca, M.: Cellular Automata equivalent to PD0L Systems. In: Proceedings of International Arab Conference on Information Technology (ACIT 2003), December 20-23, pp. 819–825. Egipto. Pub., Alexandria (2003)Google Scholar
  5. 5.
    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, Proceedings en CDROM, November 15-17. Grecia. Pub., Rodas (2003)Google Scholar
  6. 6.
    Ortega, A., de la Cruz, M., Alfonseca, M.: Christiansen Grammar Evolution: grammatical evolution with semantics. IEEE Transactions on Evolutionary Computation 11, 77–90 (2007)CrossRefGoogle Scholar
  7. 7.
    Head, T.: Splicing schemes and DNA. In: Rozenberg, G., Salomaa, A. (eds.) Lindenmayer Systems; Impacts on Theoretical Computer Science, Computer Graphics, and Developmental Biology, pp. 371–383. Springer, Berlin (1992)Google Scholar
  8. 8.
    Paun, G.: Regular extended H systems are computationally universal. Journal of Automata, Languages, Combinatorics 1(1), 27–36 (1996)zbMATHMathSciNetGoogle Scholar
  9. 9.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • J. M. Rojas Siles
    • 1
  • M. de la Cruz Echeandía
    • 2
  • A. Ortega de la Puente
    • 2
  1. 1.Departamento de Lenguajes y Sistemas Informáticos e Ingeniería de SoftwareUniversidad Politécnica de Madrid 
  2. 2.Departamento Ingeniería InformáticaUniversidad Autónoma de Madrid 

Personalised recommendations