Skip to main content

Hybrid Networks of Evolutionary Processors

  • Conference paper
  • First Online:
Genetic and Evolutionary Computation — GECCO 2003 (GECCO 2003)

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

Included in the following conference series:

Abstract

A hybrid network of evolutionary processors consists of several processors which are placed in nodes of a virtual graph and can perform one simple operation only on the words existing in that node in accordance with some strategies. Then the words which can pass the output filter of each node navigate simultaneously through the network and enter those nodes whose input filter was passed. We prove that these networks with filters defined by simple random-context conditions, used as language generating devices, are able to generate all linear languages in a very efficient way, as well as non-context-free languages. Then, when using them as computing devices, we present two linear solutions of the Common Algorithmic Problem.

This work, done when this author was visiting the Department of Computer Science and Artificial Intelligence of the University of Seville, was supported by the Generalitat de Catalunya, Direcció General de Recerca (PIV2001-50)

Work supported by the project TIC2002-04220-C03-01 of the Ministerio de Ciencia y Tecnología of Spain, cofinanced by FEDER funds

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Castellanos, J., Martín-Vide, C., Mitrana, V., Sempere, J.: Solving NP-complete problems with networks of evolutionary processors. IWANN 2001 (J. Mira, A. Prieto, eds.), LNCS 2084, Springer-Verlag (2001) 621–628.

    Google Scholar 

  2. Castellanos, J., Martín-Vide, C., Mitrana, V., Sempere, J.: Networks of evolutionary processors. Submitted (2002).

    Google Scholar 

  3. Csuhaj-Varjú, E., Dassow, J., Kelemen, J., Păun, G.: Grammar Systems, Gordon and Breach, 1993.

    Google Scholar 

  4. Csuhaj-Varjú, E., Salomaa, A.: Networks of parallel language processors. New Trends in Formal Languages (Gh. Păun, A. Salomaa, eds.), LNCS 1218, Springer Verlag (1997) 299–318.

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  6. Errico, L., Jesshope, C.: Towards a new architecture for symbolic processing. Artificial Intelligence and Information-Control Systems of Robots’ 94 (I. Plander, ed.), World Sci. Publ., Singapore (1994) 31–40.

    Google Scholar 

  7. Fahlman, S.E., Hinton, G.E., Seijnowski, T.J.: Massively parallel architectures for AI: NETL, THISTLE and Boltzmann machines. Proc. AAAI National Conf. on AI, William Kaufman, Los Altos (1983) 109–113.

    Google Scholar 

  8. Garey, M., Johnson, D.: Computers and Intractability. A Guide to the Theory of NP-completeness, Freeman, San Francisco, CA, 1979.

    MATH  Google Scholar 

  9. Head, T., Yamamura, M., Gal, S.: Aqueous computing: writing on molecules. Proc. of the Congress on Evolutionary Computation 1999, IEEE Service Center, Piscataway, NJ (1999) 1006–1010.

    Chapter  Google Scholar 

  10. Kari, L.: On Insertion and Deletion in Formal Languages, Ph.D. Thesis, University of Turku, 1991.

    Google Scholar 

  11. Kari, L., Păun, G., Thierrin, G., Yu, S.: At the crossroads of DNA computing and formal languages: Characterizing RE using insertion-deletion systems. Proc. 3rd DIMACS Workshop on DNA Based Computing, Philadelphia (1997) 318–333.

    Google Scholar 

  12. Kari, L., Thierrin, G.: Contextual insertion/deletion and computability. Information and Computation 131 (1996) 47–61.

    Article  MATH  MathSciNet  Google Scholar 

  13. Hillis, W.D.: The Connection Machine, MIT Press, Cambridge, 1985.

    Google Scholar 

  14. Martín-Vide, C., Păun, G., Salomaa, A.: Characterizations of recursively enumerable languages by means of insertion grammars. Theoretical Computer Science 205 (1998) 195–205.

    Article  MATH  MathSciNet  Google Scholar 

  15. Martín-Vide, Mitrana, V., Păun, G.: On the power of valuations in P systems. Computacion y Sistemas 5 (2001) 120–128.

    Google Scholar 

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

    Article  MATH  Google Scholar 

  17. Sankoff, D. et al.: Gene order comparisons for phylogenetic inference: Evolution of the mitochondrial genome. Proc. Natl. Acad. Sci. USA 89 (1992) 6575–6579.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Martín-Vide, C., Mitrana, V., Pérez-Jiménez, M.J., Sancho-Caparrini, F. (2003). Hybrid Networks of Evolutionary Processors. In: Cantú-Paz, E., et al. Genetic and Evolutionary Computation — GECCO 2003. GECCO 2003. Lecture Notes in Computer Science, vol 2723. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45105-6_49

Download citation

  • DOI: https://doi.org/10.1007/3-540-45105-6_49

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40602-0

  • Online ISBN: 978-3-540-45105-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics