Advertisement

On the Power of Networks of Evolutionary Processors

  • Jürgen Dassow
  • Bianca Truthe
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4664)

Abstract

We discuss the power of networks of evolutionary processors where only two types of nodes are allowed. We prove that (up to an intersection with a monoid) every recursively enumerable language can be generated by a network with one deletion and two insertion nodes. Networks with an arbitrary number of deletion and substitution nodes only produce finite languages, and for each finite language one deletion node or one substitution node is sufficient. Networks with an arbitrary number of insertion and substitution nodes only generate context-sensitive languages, and (up to an intersection with a monoid) every context-sensitive language can be generated by a network with one substitution node and one insertion node.

Keywords

Regular Language Evolution Step Derivation Step Communication Step Formal Language Theory 
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., Martín-Vide, C., Rogozhin, Y.: Networks of Evolutionary Processors with Two Nodes Are Unpredictable. In: Pre-proceedings LATA 2007, University of Tarragona, Spain. Reports of the Research Group on Math. Linguistics 35/07 (2007)Google Scholar
  2. 2.
    Alhazov, A., Martín-Vide, C., Rogozhin, Y.: On the number of nodes in universal networks of evolutionary processors. Acta Inf. 43, 331–339 (2006)MATHCrossRefGoogle Scholar
  3. 3.
    Castellanos, J., Leupold, P., Mitrana, V.: On the size complexity of hybrid networks of evolutionary processors. Theor. Comput. Sci. 330, 205–220 (2005)MATHCrossRefMathSciNetGoogle 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.M., Prieto, A.G. (eds.) IWANN 2001. LNCS, vol. 2084, pp. 621–628. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  5. 5.
    Castellanos, J., Martín-Vide, C., Mitrana, V., Sempere, J.: Networks of evolutionary processors. Acta Informatica 38, 517–529 (2003)Google Scholar
  6. 6.
    Csuhaj-Varjú, E., Martín-Vide, C., Mitrana, V.: Hybrid networks of evolutionary processors are computationally complete. Acta Informatica 41, 257–272 (2005)MATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Csuhaj-Varjú, E., Salomaa, A.: Networks of parallel language processors. In: Păun, G., Salomaa, A. (eds.) New Trends in Formal Languages. LNCS, vol. 1218, pp. 299–318. Springer, Heidelberg (1997)Google Scholar
  8. 8.
    Dassow, J.: On special networks of parallel language processors. Romanian Journal of Information Science and Technology 1, 331–341 (1998)Google Scholar
  9. 9.
    Dassow, J., Păun, G.: Regulated Rewriting in Formal Language Theory. Springer, Berlin (1989)Google Scholar
  10. 10.
    Dassow, J., Truthe, B.: On the Power of Networks of Evolutionary Processors. Otto-von-Guericke-Universität Magdeburg, Fakultät für Informatik, Technical report (2007)Google Scholar
  11. 11.
    Fahlmann, S.E., Hinton, G.E., Seijnowski, T.J.: Massively parallel architectures for AI: NETL, THISTLE and Boltzmann machines. In: Proc. AAAI National Conf. on AI, pp. 109–113. William Kaufman, Los Altos (1983)Google Scholar
  12. 12.
    Hillis, W.D.: The Connection Machine. MIT Press, Cambridge (1985)Google Scholar
  13. 13.
    Margenstern, M., Păun, G., Rogozhin, Y., Verlan, S.: Context-free insertion-deletion systems. Theor. Comput. Sci. 330, 339–348 (2005)MATHCrossRefGoogle Scholar
  14. 14.
    Rozenberg, G., Salomaa, A.: Handbook of Formal Languages. Springer, Berlin (1997)MATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Jürgen Dassow
    • 1
  • Bianca Truthe
    • 2
  1. 1.Otto-von-Guericke-Universität Magdeburg, Fakultät für Informatik, PSF 4120, D-39016 MagdeburgGermany
  2. 2.Universitat Rovira i Virgili, Facultat de Lletres, GRLMC, Plaça Imperial Tàrraco 1, E-43005 TarragonaSpain

Personalised recommendations