Skip to main content
SpringerLink
Log in

A Survey on Computationally Complete Accepting and Generating Networks of Evolutionary Processors

  • Conference paper
  • First Online:
Machines, Computations, and Universality (MCU 2022)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 13419))

Included in the following conference series:

  • 198 Accesses

Abstract

In this survey, we discuss accepting and generating networks of evolutionary processors in their various characteristics as presented in the literature over the years. We show several research directions with respect to reducing the resources needed for still being computationally complete and gather results obtained in these areas so far.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 149.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 199.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Alhazov, A., Dassow, J., Martín-Vide, C., Rogozhin, Y., Truthe, B.: On networks of evolutionary processors with nodes of two types. Fundam. Informaticae 91, 1–15 (2009)

    Article  MathSciNet  Google Scholar 

  2. Alhazov, A., Enguix, G.B., Rogozhin, Y.: Obligatory hybrid networks of evolutionary processors. In: Filipe, J., Fred, A.L.N., Sharp, B. (eds.) ICAART 2009 - Proceedings of the International Conference on Agents and Artificial Intelligence, Porto, Portugal, 19–21 January 2009, pp. 613–618. INSTICC Press (2009)

    Google Scholar 

  3. Alhazov, A., Martín-Vide, C., Rogozhin, Y.: On the number of nodes in universal networks of evolutionary processors. Acta Informatica 43(5), 331–339 (2006). https://doi.org/10.1007/s00236-006-0024-x

    Article  MathSciNet  MATH  Google Scholar 

  4. 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. (eds.) IWANN 2001. LNCS, vol. 2084, pp. 621–628. Springer, Heidelberg (2001). https://doi.org/10.1007/3-540-45720-8_74

    Chapter  MATH  Google Scholar 

  5. Castellanos, J., Martín-Vide, C., Mitrana, V., Sempere, J.M.: Networks of evolutionary processors. Acta Informatica 39(6–7), 517–529 (2003). https://doi.org/10.1007/s00236-003-0114-y

    Article  MathSciNet  MATH  Google Scholar 

  6. 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). https://doi.org/10.1007/3-540-62844-4_22

    Chapter  Google Scholar 

  7. Dassow, J., Manea, F., Truthe, B.: Networks of evolutionary processors: the power of subregular filters. Acta Informatica 50(1), 41–75 (2013). https://doi.org/10.1007/s00236-012-0172-0

    Article  MathSciNet  MATH  Google Scholar 

  8. Dassow, J., Mitrana, V.: Accepting networks of non-inserting evolutionary processors. In: Petre, I., Rozenberg, G. (eds.) Proceedings of NCGT 2008 - Workshop on Natural Computing and Graph Transformations, Leicester, United Kingdom, 8 September 2008, pp. 29–41. University of Leicester (2008)

    Google Scholar 

  9. Dassow, J., Mitrana, V.: Accepting networks of non-inserting evolutionary processors. In: Priami, C., Back, R.-J., Petre, I. (eds.) Transactions on Computational Systems Biology XI. LNCS, vol. 5750, pp. 187–199. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-04186-0_9

    Chapter  Google Scholar 

  10. Dassow, J., Mitrana, V., Truthe, B.: The role of evolutionary operations in accepting hybrid networks of evolutionary processors. Inf. Comput. 209(3), 368–382 (2011)

    Article  MathSciNet  Google Scholar 

  11. Dassow, J., Truthe, B.: On the power of networks of evolutionary processors. In: Durand-Lose, J., Margenstern, M. (eds.) MCU 2007. LNCS, vol. 4664, pp. 158–169. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-74593-8_14

    Chapter  Google Scholar 

  12. Dassow, J., Truthe, B.: On networks of evolutionary processors with state limited filters. In: Bordihn, H., Freund, R., Hinze, T., Holzer, M., Kutrib, M., Otto, F. (eds.) Second Workshop on Non-Classical Models of Automata and Applications (NCMA), Jena, Germany, 23–24 August 2010, Proceedings. books@ocg.at, vol. 263, pp. 57–70. Österreichische Computer Gesellschaft, Austria (2010)

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  14. Dassow, J., Truthe, B.: Generating networks of evolutionary processors with resources restricted and structure limited filters. J. Automata Lang. Comb. 25(2–3), 83–113 (2020)

    MathSciNet  MATH  Google Scholar 

  15. Dassow, J., Truthe, B.: Networks with evolutionary processors and ideals and codes as filters. Int. J. Found. Comput. Sci. 31(1), 73–89 (2020)

    Article  MathSciNet  Google Scholar 

  16. Dassow, J., Truthe, B.: Accepting networks of evolutionary processors with resources restricted and structure limited filters. RAIRO Theor. Inform. Appl. 55, 8 (2021)

    Article  MathSciNet  Google Scholar 

  17. Freund, R., Rogojin, V., Verlan, S.: Variants of networks of evolutionary processors with polarizations and a small number of processors. Int. J. Found. Comput. Sci. 30(6–7), 1005–1027 (2019)

    Article  MathSciNet  Google Scholar 

  18. Jürgensen, H., Konstantinidis, S.: Codes1. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, pp. 511–607. Springer, Heidelberg (1997). https://doi.org/10.1007/978-3-642-59136-5_8

    Chapter  Google Scholar 

  19. Loos, R., Manea, F., Mitrana, V.: Small universal accepting networks of evolutionary processors with filtered connections. J. Automata Lang. Comb. 15(1–2), 155–174 (2010)

    MathSciNet  MATH  Google Scholar 

  20. Manea, F., Truthe, B.: Accepting networks of evolutionary processors with subregular filters. Theory of Computing Systems 55(1), 84–109 (2014)

    Article  MathSciNet  Google Scholar 

  21. Manea, F., Truthe, B.: Accepting networks of evolutionary processors with subregular filters. Theor. Comput. Syst. 55(1), 84–109 (2013). https://doi.org/10.1007/s00224-013-9502-z

    Article  MathSciNet  MATH  Google Scholar 

  22. Margenstern, M., Mitrana, V., Pérez-Jiménez, M.J.: Accepting hybrid networks of evolutionary processors. In: Ferretti, C., Mauri, G., Zandron, C. (eds.) DNA 2004. LNCS, vol. 3384, pp. 235–246. Springer, Heidelberg (2005). https://doi.org/10.1007/11493785_21

    Chapter  Google Scholar 

  23. Martín-Vide, C., Mitrana, V.: Networks of evolutionary processors: results and perspectives. In: Molecular Computational Models: Unconventional Approaches, pp. 78–114 (2005)

    Google Scholar 

  24. Martín-Vide, C., Mitrana, V., Pérez-Jiménez, M.J., Sancho-Caparrini, F.: Hybrid networks of evolutionary processors. In: Cantú-Paz, E. (ed.) GECCO 2003. LNCS, vol. 2723, pp. 401–412. Springer, Heidelberg (2003). https://doi.org/10.1007/3-540-45105-6_49

    Chapter  MATH  Google Scholar 

  25. Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages. Springer, Heidelberg (1997). https://doi.org/10.1007/978-3-642-59136-5

    Book  MATH  Google Scholar 

  26. Shyr, H.J.: Free Monoids and Languages. Hon Min Book Company, Taichung, Taiwan (1991)

    MATH  Google Scholar 

  27. Truthe, B.: Networks of evolutionary processors with resources restricted filters. In: Freund, R., Hospodár, M., Jirásková, G., Pighizzini, G. (eds.) Tenth Workshop on Non-Classical Models of Automata and Applications (NCMA), Košice, Slovakia, 21–22 August 2018, Proceedings. books@ocg.at, vol. 332, pp. 165–180. Österreichische Computer Gesellschaft (2018)

    Google Scholar 

  28. Truthe, B.: Accepting networks of evolutionary processors with resources restricted filters. In: Freund, R., Holzer, M., Sempere, J.M. (eds.) Eleventh Workshop on Non-Classical Models of Automata and Applications (NCMA), Valencia, Spain, 2–3 July 2019, Proceedings. books@ocg.at, vol. 336, pp. 187–202. Österreichische Computer Gesellschaft (2019)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut Für Informatik, Universität Giessen, Arndtstr. 2, 35392, Giessen, Germany

    Bianca Truthe

Authors
  1. Bianca Truthe
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Bianca Truthe .

Editor information

Editors and Affiliations

  1. Université d’Orléans, Orléans, France

    Jérôme Durand-Lose

  2. University of Debrecen, Debrecen, Hungary

    György Vaszil

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Truthe, B. (2022). A Survey on Computationally Complete Accepting and Generating Networks of Evolutionary Processors. In: Durand-Lose, J., Vaszil, G. (eds) Machines, Computations, and Universality. MCU 2022. Lecture Notes in Computer Science, vol 13419. Springer, Cham. https://doi.org/10.1007/978-3-031-13502-6_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-13502-6_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-13501-9

  • Online ISBN: 978-3-031-13502-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation