About Universal Hybrid Networks of Evolutionary Processors of Small Size

  • Artiom Alhazov
  • Erzsébet Csuhaj-Varjú
  • Carlos Martín-Vide
  • Yurii Rogozhin
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5196)


A hybrid network of evolutionary processors (an HNEP) is a graph with a language processor, input and output filters associated to each node. A language processor performs one type of point mutations (insertion, deletion or substitution) on the words in that node. The filters are defined by certain variants of random-context conditions. In this paper, we present a universal complete HNEP with 10 nodes simulating circular Post machines and show that every recursively enumerable language can be generated by a complete HNEP with 10 nodes. Thus, we positively answer the question posed in [5] about the possibility to generate an arbitrary recursively enumerable language over an alphabet V with a complete HNEP of a size smaller than 27 + 3·card(V).


Bio-inspired computing Hybrid networks of evolutionary processors Small universal systems Descriptional complexity Circular Post machines 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Alhazov, A., Martín-Vide, C., Rogozhin, Y.: On the number of nodes in universal networks of evolutionary processors. Acta Informatica 43(5), 331–339 (2006)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Alhazov, A., Martín-Vide, C., Rogozhin, Y.: Networks of Evolutionary Processors with Two Nodes Are Unpredictable. In: Pre-Proceedings of the 1st International Conference on Language and Automata Theory and Applications, LATA 2007, GRLMC report 35/07, Rovira i Virgili University, Tarragona, Spain, pp.521–528 (2007)Google Scholar
  3. 3.
    Alhazov, A., Kudlek, M., Rogozhin, Y.: Nine Universal Circular Post Machines. Computer Science Journal of Moldova 10(3), 247–262 (2002)zbMATHMathSciNetGoogle Scholar
  4. 4.
    Castellanos, J., Martín-Vide, C., Mitrana, V., Sempere, J.: Solving NP-complete problems with networks of evolutionary processors. In: Mira, J., Prieto, A. (eds.) IWANN 2001. LNCS, vol. 2084. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  5. 5.
    Csuhaj-Varjú, E., Martín-Vide, C., Mitrana, V.: Hybrid networks of evolutionary processors are computationally complete. Acta Informatica 41(4-5), 257–272 (2005)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Csuhaj-Varjú, E., Salomaa, A.: Networks of Parallel Language Processors. In: Păun, G., Salomaa, A. (eds.) New Trends in Formal Languages. Control, Cooperation, and Combinatorics. LNCS, vol. 1218, pp. 299–318. Springer, Heidelberg (1997)Google Scholar
  7. 7.
    Kudlek, M., Rogozhin, Y.: Small Universal Circular Post Machines. Computer Science Journal of Moldova 9(1), 34–52 (2001)zbMATHMathSciNetGoogle Scholar
  8. 8.
    Kudlek, M., Rogozhin, Y.: New Small Universal Circular Post Machines. In: Freivalds, R. (ed.) FCT 2001. LNCS, vol. 2138, pp. 217–227. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  9. 9.
    Martín-Vide, C., Mitrana, V., Perez-Jimenez, M., Sancho-Caparrini, F.: Hybrid networks of evolutionary processors. In: Cantú-Paz, E., et al. (eds.) GECCO 2003. LNCS, vol. 2723, pp. 401–412. Springer, Heidelberg (2003)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Artiom Alhazov
    • 1
    • 2
  • Erzsébet Csuhaj-Varjú
    • 3
    • 4
  • Carlos Martín-Vide
    • 5
  • Yurii Rogozhin
    • 5
    • 2
  1. 1.Department of Information Technologies, Turku Center for Computer ScienceÅbo Akademi UniversityTurkuFinland
  2. 2.Institute of Mathematics and Computer ScienceAcademy of Sciences of MoldovaChişinăuMoldova
  3. 3.Hungarian Academy of SciencesComputer and Automation Research InstituteBudapestHungary
  4. 4.Faculty of Informatics, Department of Algorithms and Their ApplicationsEötvös Loránd UniversityBudapestHungary
  5. 5.Research Group on Mathematical LinguisticsRovira i Virgili UniversityTarragonaSpain

Personalised recommendations