Article

Hybrid networks of evolutionary processors

Authors:

Carlos Martín-Vide,

Victor Mitrana,

Mario J. Pérez-Jiménez,

Fernando Sancho-CaparriniAuthors Info & Claims

GECCO'03: Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI

Pages 401 - 412

Published: 12 July 2003 Publication History

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.

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.

Digital Library

[2]

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

[3]

Csuhaj-Varjú, E., Dassow, J., Kelemen, J., P?aun, G.: Grammar Systems, Gordon and Breach, 1993.

[4]

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

Digital Library

[5]

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

[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.

Digital Library

[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.

[8]

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

Digital Library

[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.

[10]

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

[11]

Kari, L., Paun, 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.

[12]

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

Digital Library

[13]

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

Digital Library

[14]

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

Digital Library

[15]

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

[16]

Paun, G.: Computing with membranes. J. Comput. Syst. Sci. 61(2000) 108-143.

Digital Library

[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.

Cited By

(2017)On the computational power of networks of polarized evolutionary processorsInformation and Computation10.1016/j.ic.2016.06.004253:P3(371-380)Online publication date: 1-Apr-2017
https://dl.acm.org/doi/10.1016/j.ic.2016.06.004
Arroyo FGómez Canaval SMitrana VPopescu Ş(2014)Networks of Polarized Evolutionary Processors Are Computationally CompleteProceedings of the 8th International Conference on Language and Automata Theory and Applications - Volume 837010.1007/978-3-319-04921-2_8(101-112)Online publication date: 10-Mar-2014
https://dl.acm.org/doi/10.1007/978-3-319-04921-2_8
Jiménez-López M(2011)Computing languages with bio-inspired devices and multi-agent systemsProceedings of the 11th international conference on Artificial neural networks conference on Advances in computational intelligence - Volume Part I10.5555/2023252.2023320(481-488)Online publication date: 8-Jun-2011
https://dl.acm.org/doi/10.5555/2023252.2023320
Show More Cited By

Index Terms

Hybrid networks of evolutionary processors
1. Software and its engineering
  1. Software notations and tools
    1. Formal language definitions
2. Theory of computation
  1. Formal languages and automata theory
  2. Logic

Index terms have been assigned to the content through auto-classification.

Recommendations

Hybrid networks of evolutionary processors are computationally complete

A hybrid network of evolutionary processors (an HNEP) consists of several language processors which are located in the nodes of a virtual graph and able to perform only one type of point mutations (insertion, deletion, substitution) on the words found ...
Networks of evolutionary processors: the power of subregular filters

In this paper, we propose a hierarchy of families of languages generated by networks of evolutionary processors where the filters belong to several special classes of regular sets. More precisely, we show that the use of filters from the class of ...
About Universal Hybrid Networks of Evolutionary Processors of Small Size
Language and Automata Theory and Applications

A hybrid network of evolutionary processors (an HNEP) is a graph with a language processor, input and output filters associated to each node. A language processor performs one type of point mutations (insertion, deletion or substitution) on the words in ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

GECCO'03: Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI

July 2003

1251 pages

ISBN:3540406026

Editor:
Erick Cantú-Paz
Center for Applied Scientific Computing, Lawrence Livermore National Laboratory, Livermore, CA

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 12 July 2003

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

17
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 16 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

(2017)On the computational power of networks of polarized evolutionary processorsInformation and Computation10.1016/j.ic.2016.06.004253:P3(371-380)Online publication date: 1-Apr-2017
https://dl.acm.org/doi/10.1016/j.ic.2016.06.004
Arroyo FGómez Canaval SMitrana VPopescu Ş(2014)Networks of Polarized Evolutionary Processors Are Computationally CompleteProceedings of the 8th International Conference on Language and Automata Theory and Applications - Volume 837010.1007/978-3-319-04921-2_8(101-112)Online publication date: 10-Mar-2014
https://dl.acm.org/doi/10.1007/978-3-319-04921-2_8
Jiménez-López M(2011)Computing languages with bio-inspired devices and multi-agent systemsProceedings of the 11th international conference on Artificial neural networks conference on Advances in computational intelligence - Volume Part I10.5555/2023252.2023320(481-488)Online publication date: 8-Jun-2011
https://dl.acm.org/doi/10.5555/2023252.2023320
Alhazov ABel-Enguix GKrassovitskiy ARogozhin Y(2011)About complete obligatory hybrid networks of evolutionary processors without substitutionProceedings of the 11th international conference on Artificial neural networks conference on Advances in computational intelligence - Volume Part I10.5555/2023252.2023315(441-448)Online publication date: 8-Jun-2011
https://dl.acm.org/doi/10.5555/2023252.2023315
del Rosal Ede la Cruz Mde la Puente A(2011)Towards the automatic programming of NEPsProceedings of the 4th international conference on Interplay between natural and artificial computation - Volume Part I10.5555/2009405.2009437(303-312)Online publication date: 30-May-2011
https://dl.acm.org/doi/10.5555/2009405.2009437
Alhazov ACsuhaj-Varjú EMartín-Vide CRogozhin Y(2009)On the size of computationally complete hybrid networks of evolutionary processorsTheoretical Computer Science10.1016/j.tcs.2009.05.003410:35(3188-3197)Online publication date: 1-Aug-2009
https://dl.acm.org/doi/10.1016/j.tcs.2009.05.003
Bel-Enguix GJiménez-López M(2009)Multi-agent Simulation of Linguistic ProcessesAgent Computing and Multi-Agent Systems10.1007/978-3-642-01639-4_27(308-318)Online publication date: 21-Apr-2009
https://dl.acm.org/doi/10.1007/978-3-642-01639-4_27
Alhazov ACsuhaj-Varjú EMartín-Vide CRogozhin Y(2008)About Universal Hybrid Networks of Evolutionary Processors of Small SizeLanguage and Automata Theory and Applications10.1007/978-3-540-88282-4_5(28-39)Online publication date: 1-Jun-2008
https://dl.acm.org/doi/10.1007/978-3-540-88282-4_5
Manea FMartin-Vide CMitrana V(2007)On the size complexity of universal accepting hybrid networks of evolutionary processorsMathematical Structures in Computer Science10.1017/S096012950700620217:4(753-771)Online publication date: 1-Aug-2007
https://dl.acm.org/doi/10.1017/S0960129507006202
Castellanos JLeupold PMitrana V(2005)On the size complexity of hybrid networks of evolutionary processorsTheoretical Computer Science10.1016/j.tcs.2004.07.035330:2(205-220)Online publication date: 2-Feb-2005
https://dl.acm.org/doi/10.1016/j.tcs.2004.07.035
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents