Towards the Automatic Programming of NEPs: A First Case Study

  • Emilio del Rosal
  • Alfonso Ortega
  • Marina de la Cruz
Part of the Advances in Intelligent and Soft Computing book series (AINSC, volume 156)


This work shows the first results of our platform for the automatic design of NEPs to solve specific tasks. The platform is based on a genetic programming algorithm that we have proposed earlier. It uses Christiansen grammars to exclude individuals with either syntactic or semantic mistakes. The fitness function required by the genetic engine, usually invokes a simulator of the model under consideration. In this work we use jNEP, a Java simulator for NEPs developed by our research group. We have chosen a non trivial problem borrowed from a NEP that applies context free rules for simulating pushdown automata: the rotation of the strings until finding the symbol to which the rule will be applied, which is one of the three steps this NEP takes. We have found some interesting solutions.


Context Free Grammar Grammatical Evolution Terminal Symbol Trivial Problem Attribute Grammar 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Castellanos, J., Martin-Vide, C., Mitrana, V., Sempere, J.M.: Networks of evolutionary processors. Acta Informatica 39(6-7), 517–529 (2003)MathSciNetzbMATHGoogle Scholar
  2. 2.
    Christiansen, H.: A survey of adaptable grammars. SIGPLAN Notices 25(11), 35–44 (1990)CrossRefGoogle Scholar
  3. 3.
    Csuhaj-Varju, E., Martin-Vide, C., Mitrana, V.: Hybrid networks of evolutionary processors are computationally complete. Acta Informatica 41(4-5), 257–272 (2005)MathSciNetzbMATHCrossRefGoogle Scholar
  4. 4.
    de la Cruz Echeandía, M., de la Puente, A.O., Alfonseca, M.: Attribute Grammar Evolution. In: Mira, J., Álvarez, J.R. (eds.) IWINAC 2005. LNCS, vol. 3562, pp. 182–191. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  5. 5.
    del Rosal, E., de la Cruz, M., Ortega de la Puente, A.: Towards the Automatic Programming of NEPs. In: Ferrández, J.M., Álvarez Sánchez, J.R., de la Paz, F., Toledo, F.J. (eds.) IWINAC 2011, Part I. LNCS, vol. 6686, pp. 303–312. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  6. 6.
    Knuth, D.E.: Semantics of Context-Free Languages. Mathematical Systems Theory 2(2), 127–145 (1968)MathSciNetzbMATHCrossRefGoogle Scholar
  7. 7.
    Manea, F., Martín-Vide, C., Mitrana, V.: Solving 3CNF-SAT and HPP in Linear Time Using WWW. In: Margenstern, M. (ed.) MCU 2004. LNCS, vol. 3354, pp. 269–280. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  8. 8.
    ONeill, M., Conor, R.: Grammatical Evolution, evolutionary automatic programming in an arbitrary language. Kluwer Academic Publishers (2003)Google Scholar
  9. 9.
    Ortega, A., de la Cruz, M., Alfonseca, M.: Christiansen grammar evolution: Grammatical evolution with semantics. IEEE Transactions on Evolutionary Computation 11(1), 77–90 (2007)CrossRefGoogle Scholar
  10. 10.
    Watt, D.A., Madsen, O.L.: Extended attribute grammars. Technical Report 10, University of Glasgow (July 1977)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Emilio del Rosal
    • 1
  • Alfonso Ortega
    • 1
  • Marina de la Cruz
    • 1
  1. 1.Escuela Politécnica Superior, Departamento de Ingeniería InformáticaUniversiad Autónoma de MadridMadridSpain

Personalised recommendations