Natural Computing

, Volume 11, Issue 4, pp 595–607 | Cite as

Networks of evolutionary processors: computationally complete normal forms

  • Jürgen Dassow
  • Florin Manea
  • Bianca Truthe


Networks of evolutionary processors (NEPs, for short) form a bio-inspired language generating computational model that was shown to be equivalent to the model of phrase-structure grammars. In this paper, we analyse different restricted variants of NEPs that preserve the computational power of the general model. We prove that any recursively enumerable language can be generated by a NEP where the derivation rules can be applied at arbitrarily chosen positions, the control of the communication is done by finite automata with at most three states, and either the rule sets are singletons or the underlying graph is a complete graph. If one uses networks with arbitrary underlying graphs and allows the additional application of insertions and deletions only to the right-most or the to left-most position of the derived words for some nodes, then we only need automata with only one state to control the communication in the network. Clearly, this result is optimal; moreover, finite automata with two states are necessary and sufficient in order to generate all the recursively enumerable languages when the derivation rules can be applied only at arbitrarily chosen positions.


Bio-inspired language generating models Generating networks of evolutionary processors Computational completeness Normal form Restricted filtering 



Florin Manea’s work was partially supported by the Alexander von Humboldt Foundation through a Research Fellowship at the Otto-von-Guericke University Magdeburg, Germany, between July 2009 and June 2011 and a subsequent Return Fellowship at the University of Bucharest, Romania, between July 2011 and October 2011. His work is currently supported by DFG—Deutsche Forschungsgemeinschaft through the grant 582014.


  1. Alhazov A, Csuhaj-Varjú E, Martín-Vide C, Rogozhin Y (2009a) On the size of computationally complete hybrid networks of evolutionary processors. Theor Comput Sci 410:3188–3197MATHCrossRefGoogle Scholar
  2. Alhazov A, Dassow J, Martín-Vide C, Rogozhin Y, Truthe B (2009b) On networks of evolutionary processors with nodes of two types. Fundam Inform 91:1–15MATHGoogle Scholar
  3. Castellanos J, Martín-Vide C, Mitrana V, Sempere JM (2001) Solving NP-complete problems with networks of evolutionary processors. In: Proceedings of IWANN 2001. Lecture notes in computer science, vol 2084. Springer-Verlag, Berlin, pp 621–628Google Scholar
  4. Castellanos J, Martín-Vide C, Mitrana V, Sempere JM (2003) Networks of evolutionary processors. Acta Inform 39(6–7):517–529MathSciNetMATHGoogle Scholar
  5. Csuhaj-Varjú E, Mitrana V (2000) Evolutionary systems: a language generating device inspired by evolving communities of cells. Acta Inform 36(11):913–926MathSciNetMATHCrossRefGoogle Scholar
  6. Csuhaj-Varjú E, Salomaa A (1997) Networks of parallel language processors. In: New trends in formal languages—control, cooperation, and combinatorics. Lecture notes in computer science, vol 1218. Springer-Verlag, Berlin, pp 299–318Google Scholar
  7. Dassow J, Truthe B (2011) On networks of evolutionary processors with filters accepted by two-state-automata. Fundam Inform 112(2–3):157–170MathSciNetMATHGoogle Scholar
  8. Dassow J, Manea F, Truthe B (2011) Networks of evolutionary processors with subregular filters. In: Proceedings of LATA 2011. Lecture notes in computer science, vol 6638. Springer-Verlag, Berlin, pp 262–273Google Scholar
  9. Errico LD, Jesshope, C (1994) Towards a new architecture for symbolic processing. In: AIICSR’94: proceedings of the sixth international conference on artificial intelligence and information-control systems of robots. World Scientific, River Edge, pp 31–40Google Scholar
  10. Fahlman SE, Hinton GE, Sejnowski TJ (1983) Massively parallel architectures for AI: NETL, thistle, and Boltzmann machines. In: Proceedings of AAAI 1983. AAAI Press, Stanford, pp 109–113Google Scholar
  11. Geffert V (1991) Normal forms for phrase-structure grammars. RAIRO—Theor Inform Appl 25:473–496MathSciNetMATHGoogle Scholar
  12. Hillis WD (1986) The connection machine. MIT Press, CambridgeGoogle Scholar
  13. Martín-Vide C, Mitrana V (2005) Networks of evolutionary processors: results and perspectives’. In: Gheorghe M (ed) Molecular computational models: unconventional approaches. Idea Group Publishing, Hershey, pp 78–114Google Scholar
  14. Păun G (2000) Computing with membranes. J Comput Syst Sci 61(1):108–143MATHCrossRefGoogle Scholar
  15. Păun G, Sântean L (1989) Parallel communicating grammar systems: the regular case. Ann Univ Bucharest Ser Mat Inform 38:55–63MATHGoogle Scholar
  16. Rozenberg G, Salomaa A (1997) Handbook of formal languages. Springer-Verlag, BerlinMATHCrossRefGoogle Scholar
  17. Sankoff D, Leduc G, Antoine G, Paquin B, Lang F, Cedergren R (1992) Gene order comparisons for phylogenetic inference: evolution of the mitochondrial genome. Proc Natl Acad Sci USA 89(14):6575–6579CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media B.V. 2012

Authors and Affiliations

  1. 1.Fakultät für InformatikOtto-von-Guericke-Universität MagdeburgMagdeburgGermany
  2. 2.Institut für InformatikChristian-Albrechts-Universität zu KielKielGermany
  3. 3.Faculty of Mathematics and Computer ScienceUniversity of BucharestBucharestRomania

Personalised recommendations