Skip to main content
    • Aa
    • Aa

On the size complexity of universal accepting hybrid networks of evolutionary processors


In this paper we discuss the following interesting question about accepting hybrid networks of evolutionary processors (AHNEP), which are a recently introduced bio-inspired computing model. The question is: how many processors are required in such a network to recognise a given language L? Two answers are proposed for the most general case, when L is a recursively enumerable language, and both answers improve on the previously known bounds. In the first case the network has a number of processors that is linearly bounded by the cardinality of the tape alphabet of a Turing machine recognising the given language L. In the second case we show that an AHNEP with a fixed underlying structure can accept any recursively enumerable language. The second construction has another useful property from a practical point of view as it includes a universal AHNEP as a subnetwork, and hence only a limited number of its parameters depend on the given language.

Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

J. Castellanos , P. Leupold and V. Mitrana (2005) Descriptional and computational complexity aspects of hybrid networks of evolutionary processors. Theoretical Computer Science 330 (2) 205220.

E. Csuhaj-Varjú and A. Salomaa (2003) Networks of Watson-Crick D0L systems. In: M. Ito and T. Imaoka (eds.) Proc. International Conference Words, Languages & Combinatorics III, World Scientific134150.

F. Manea , C. Martin-Vide and V. Mitrana (2005) Solving 3CNF-SAT and HPP in linear time using WWW MCU 2004. Springer-Verlag Lecture Notes in Computer Science 3354 269280.

F. Manea , C. Martin-Vide and V. Mitrana (2006) A universal accepting hybrid network of evolutionary processors. First International Workshop on Developments in Computational Models, DCM'05. Electronic Notes in Theoretical Computer Science 135 95105.

M. Margenstern , V. Mitrana and M. Perez-Jimenez (2004) Accepting hybrid networks of evolutionary processors. Proc. DNA Based Computers DNA 10. Springer-Verlag Lecture Notes in Computer Science 3384 235246.

G. Păun (2002) Membrane Computing. An Introduction, Springer-Verlag.

D. Sankoff , G. Leduc , N. Antoine , B. Paquin , B. F. Lang and R. Cedergren (1992) Gene order comparisons for phylogenetic inference: Evolution of the mitochondrial genome. Proc. Natl. Acad. Sci. USA 89 65756579.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Mathematical Structures in Computer Science
  • ISSN: 0960-1295
  • EISSN: 1469-8072
  • URL: /core/journals/mathematical-structures-in-computer-science
Please enter your name
Please enter a valid email address
Who would you like to send this to? *


Full text views

Total number of HTML views: 0
Total number of PDF views: 7 *
Loading metrics...

Abstract views

Total abstract views: 58 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 22nd September 2017. This data will be updated every 24 hours.