Skip to main content
Log in

Networks of evolutionary processors: computationally complete normal forms

  • Published:
Natural Computing Aims and scope Submit manuscript


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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2

Similar content being viewed by others


  • 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–3197

    Article  MATH  Google Scholar 

  • 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–15

    MATH  Google Scholar 

  • 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–628

  • Castellanos J, Martín-Vide C, Mitrana V, Sempere JM (2003) Networks of evolutionary processors. Acta Inform 39(6–7):517–529

    MathSciNet  MATH  Google Scholar 

  • Csuhaj-Varjú E, Mitrana V (2000) Evolutionary systems: a language generating device inspired by evolving communities of cells. Acta Inform 36(11):913–926

    Article  MathSciNet  MATH  Google Scholar 

  • 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–318

  • Dassow J, Truthe B (2011) On networks of evolutionary processors with filters accepted by two-state-automata. Fundam Inform 112(2–3):157–170

    MathSciNet  MATH  Google Scholar 

  • 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–273

  • 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–40

  • 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–113

  • Geffert V (1991) Normal forms for phrase-structure grammars. RAIRO—Theor Inform Appl 25:473–496

    MathSciNet  MATH  Google Scholar 

  • Hillis WD (1986) The connection machine. MIT Press, Cambridge

    Google Scholar 

  • 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–114

  • Păun G (2000) Computing with membranes. J Comput Syst Sci 61(1):108–143

    Article  MATH  Google Scholar 

  • Păun G, Sântean L (1989) Parallel communicating grammar systems: the regular case. Ann Univ Bucharest Ser Mat Inform 38:55–63

    MATH  Google Scholar 

  • Rozenberg G, Salomaa A (1997) Handbook of formal languages. Springer-Verlag, Berlin

    Book  MATH  Google Scholar 

  • 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–6579

    Article  Google Scholar 

Download references


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.

Author information

Authors and Affiliations


Corresponding author

Correspondence to Florin Manea.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dassow, J., Manea, F. & Truthe, B. Networks of evolutionary processors: computationally complete normal forms. Nat Comput 11, 595–607 (2012).

Download citation

  • Published:

  • Issue Date:

  • DOI: