Advertisement

Complete Obligatory Hybrid Networks of Evolutionary Processors

  • Artiom Alhazov
  • Gemma Bel-Enguix
  • Alexander Krassovitskiy
  • Yurii Rogozhin
Part of the Advances in Intelligent and Soft Computing book series (AINSC, volume 89)

Abstract

We consider obligatory hybrid networks of evolutionary processors (OHNEPs) introduced recently. It is a variant of hybrid network of evolutionary processors (HNEPs), differing from the main model as follows: in OHNEP a node discards the strings to which no operations are applicable, and underlying graph is directed. In this paper we consider OHNEPs with complete underlying graph. We show that such networks are computationally complete even using very simple evolutionary processors: one operation per node (obligatory left deletion, right insertion and obligatory substitution). In our proof, the total power of input/output filters does not exceed 3 symbols.

Keywords

Complete Graph Output Node Mathematical Linguistics Node Init Hybrid Network 
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, January 19-21, pp. 613–618 (2009)Google Scholar
  2. 2.
    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)CrossRefzbMATHMathSciNetGoogle Scholar
  3. 3.
    Alhazov, A., Dassow, J., Martín-Vide, C., Rogozhin, Y., Truthe, B.: On Networks of Evolutionary Processors with Nodes of Two Types. Fundamenta Informaticae 91(1), 1–15 (2009)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.G. (eds.) IWANN 2001. LNCS, vol. 2084, pp. 521–528. Springer, Heidelberg (2001)Google 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)CrossRefzbMATHMathSciNetGoogle Scholar
  6. 6.
    Kudlek, M., Rogozhin, Y.: Small Universal Circular Post Machines. Computer Science Journal of Moldova 9(1), 34–52 (2001)zbMATHMathSciNetGoogle Scholar
  7. 7.
    Loos, R., Manea, F., Mitrana, V.: Small universal accepting hybrid networks of evolutionary processors. Acta Informatica 47, 133–146 (2010)CrossRefzbMATHMathSciNetGoogle Scholar
  8. 8.
    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

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 SciencesMoldova
  2. 2.Research Group on Mathematical LinguisticsRovira i Virgili UniversitySpain

Personalised recommendations