Hostname: page-component-8448b6f56d-c4f8m Total loading time: 0 Render date: 2024-04-24T22:56:36.268Z Has data issue: false hasContentIssue false
  • English
  • Français

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

Published online by Cambridge University Press:  01 August 2007

FLORIN MANEA ,
CARLOS MARTIN-VIDE  and
VICTOR MITRANA
FLORIN MANEA
Affiliation:
Faculty of Mathematics and Computer Science, University of Bucharest, Str. Academiei 14, 70109, Bucharest, Romania
CARLOS MARTIN-VIDE
Affiliation:
Research Group on Mathematical Linguistics, Rovira i Virgili University, Pça Imperial Tàrraco 1, 43005 Tarragona, Spain
VICTOR MITRANA
Affiliation:
Faculty of Mathematics and Computer Science, University of Bucharest, Str. Academiei 14, 70109, Bucharest, Romania Research Group on Mathematical Linguistics, Rovira i Virgili University, Pça Imperial Tàrraco 1, 43005 Tarragona, Spain
Get access Rights & Permissions [Opens in a new window]

Abstract

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.

Type
Paper
Information
Mathematical Structures in Computer Science , Volume 17 , Issue 4 , August 2007 , pp. 753 - 771
Copyright
Copyright © Cambridge University Press 2007

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Castellanos, J., Martin-Vide, C., Mitrana, V. and Sempere, J. (2001) Solving NP-complete problems with networks of evolutionary processors. In: Mira, J. and Prieto, A. (eds.) IWANN 2001. Springer-Verlag Lecture Notes in Computer Science 2084 621–628.CrossRefGoogle Scholar
Castellanos, J., Martin-Vide, C., Mitrana, V. and Sempere, J. (2003) Networks of evolutionary processors. Acta Informatica 39 517–529.CrossRefGoogle Scholar
Castellanos, J., Leupold, P. and Mitrana, V. (2005) Descriptional and computational complexity aspects of hybrid networks of evolutionary processors. Theoretical Computer Science 330 (2)205–220.CrossRefGoogle Scholar
Csuhaj-Varjú, E., Dassow, J., Kelemen, J. and Păun, G. (1993) Grammar Systems, Gordon and Breach.Google Scholar
Csuhaj-Varjú, E. and Salomaa, A. (1997) Networks of parallel language processors. In: Păun, G. and Salomaa, A. (eds.) New Trends in Formal Languages. Springer-Verlag Lecture Notes in Computer Science 1218 299–318.CrossRefGoogle Scholar
Csuhaj-Varjú, E. and Salomaa, A. (2003) Networks of Watson-Crick D0L systems. In: Ito, M. and Imaoka, T. (eds.) Proc. International Conference Words, Languages & Combinatorics III, World Scientific 134–150.Google Scholar
Errico, L. and Jesshope, C. (1994) Towards a new architecture for symbolic processing. In: Plander, I. (ed.) Artificial Intelligence and Information-Control Systems of Robots'94, World Scientific 31–40.Google Scholar
Fahlman, S. E., Hinton, G. E. and Seijnowski, T. J. (1983) Massively parallel architectures for AI: NETL, THISTLE and Boltzmann machines. Proc. AAAI National Conf. on AI, William Kaufman, Los Altos109–113.Google Scholar
Garey, M. and Johnson, D. (1979) Computers and Intractability. A Guide to the Theory of NP-completeness, Freeman.Google Scholar
Hillis, W. D. (1985) The Connection Machine, MIT Press.Google Scholar
Manea, F., Martin-Vide, C. and Mitrana, V. (2005) Solving 3CNF-SAT and HPP in linear time using WWW MCU 2004. Springer-Verlag Lecture Notes in Computer Science 3354 269–280.CrossRefGoogle Scholar
Manea, F., Martin-Vide, C. and Mitrana, V. (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 95–105.CrossRefGoogle Scholar
Margenstern, M., Mitrana, V. and Perez-Jimenez, M. (2004) Accepting hybrid networks of evolutionary processors. Proc. DNA Based Computers DNA 10. Springer-Verlag Lecture Notes in Computer Science 3384 235–246.CrossRefGoogle Scholar
Martin-Vide, C., Mitrana, V., Perez-Jimenez, M. and Sancho-Caparrini, F. (2003) Hybrid networks of evolutionary processors. Proc. of GECCO 2003. Springer-Verlag Lecture Notes in Computer Science 2723 401–412.Google Scholar
Pûaun, G. aun, G., Rozenberg, G. and Salomaa, A. (1998) DNA Computing. New Computing Paradigms, Springer-Verlag.Google Scholar
Păun, G. (2002) Membrane Computing. An Introduction, Springer-Verlag.CrossRefGoogle Scholar
Sankoff, D., Leduc, G., Antoine, N., Paquin, B., Lang, B. F. and Cedergren, R. (1992) Gene order comparisons for phylogenetic inference: Evolution of the mitochondrial genome. Proc. Natl. Acad. Sci. USA 89 6575–6579.CrossRefGoogle ScholarPubMed