Advertisement

About Complete Obligatory Hybrid Networks of Evolutionary Processors without Substitution

  • Artiom Alhazov
  • Gemma Bel-Enguix
  • Alexander Krassovitskiy
  • Yurii Rogozhin
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6691)

Abstract

In this paper we consider complete obligatory hybrid networks of evolutionary processors (OHNEPs) with insertion and deletion operations (without substitution). Such networks are not computationally complete and we modify the notion of obligatory operation introduced in [1] in order to reach universality. We use very simple evolutionary processors with one modified operation of insertion or deletion per node (without substitution). Using techniques presented in the paper a universal complete OHNEP with 182 nodes can be constructed.

Keywords

Output Node Regular Language Mathematical Linguistics Hybrid Network Underlying Graph 
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.
    Alhazov, A., Bel-Enguix, G.,Rogozhin, Y.: Obligatory Hybrid Networks of Evolutionary Processors. In: Proc. of the First International Conference on Agents and Artificial Intelligents, ICAART 2009, Porto, Portugal, January19-21, pp. 613 – 618 (2009)Google Scholar
  2. 2.
    Alhazov, A., Bel-Enguix, G., Krassovitskiy, A., Rogozhin, Y.: Complete Obligatory Hybrid Networks of Evolutionary Processors. In: 9th International Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS 2011), April 6 - 8, University of Salamanca, Spain (2011) (accepted)Google Scholar
  3. 3.
    Alhazov, A., Csuhaj-Varjú, E., Martín-Vide, C., Rogozhin, Y.: On the Size of Computationally Complete Hybrid Networks of Evolutionary Processors. Theoretical Computer Science 410, 3188–3197 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Alhazov, A., Dassow, J., Martín-Vide, C.: On Networks of Evolutionary Processors with Nodes of Two Types. Fundamenta Informaticae 91(1), 1–15 (2009)MathSciNetzbMATHGoogle Scholar
  5. 5.
    Alhazov, A., Kudlek, M., Rogozhin, Y.: Nine Universal Circular Post Machines. Computer Science Journal of Moldova 10(3), 247–262 (2002)MathSciNetzbMATHGoogle Scholar
  6. 6.
    Castellanos, J., Martín-Vide, C., Mitrana, V., Sempere, J.M.: Solving NP-complete problems with networks of evolutionary processors. In: Mira, J., Prieto, A.G. (eds.) IWANN 2001. LNCS, vol. 2084, pp. 521–528. Springer, Heidelberg (2001)Google Scholar
  7. 7.
    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)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Kudlek, M., Rogozhin, Y.: Small Universal Circular Post Machines. Computer Science Journal of Moldova 9(1), 34–52 (2001)MathSciNetzbMATHGoogle Scholar
  9. 9.
    Loos, R., Manea, F., Mitrana, V.: Small universal accepting hybrid networks of evolutionary processors. Acta Informatica 47, 133–146 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Martín-Vide, C., Mitrana, V., Pérez-Jiménez, M., Sancho-Caparrini, F.: Hybrid Networks of Evolutionary Processors. In: Cantú-Paz, E., Foster, J.A., Deb, K., Davis, L., Roy, R., O’Reilly, U.-M., Beyer, H.-G., Kendall, G., Wilson, S.W., Harman, M., Wegener, J., Dasgupta, D., Potter, M.A., Schultz, A., Dowsland, K.A., Jonoska, N., Miller, J., Standish, R.K. (eds.) GECCO 2003. LNCS, vol. 2723, pp. 401–412. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  11. 11.
    Verlan, S.: On minimal context-free insertion-deletion systems. Journal of Automata, Languages and Combinatorics 12(1-2), 317–328 (2007)MathSciNetzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Artiom Alhazov
    • 1
  • Gemma Bel-Enguix
    • 2
  • Alexander Krassovitskiy
    • 2
  • Yurii Rogozhin
    • 1
  1. 1.Institute of Mathematics and Computer ScienceAcademy of Sciences of MoldovaMoldova
  2. 2.Rovira i Virgili University Research Group on MathematicalTarragonaSpain

Personalised recommendations