Hybrid Networks of Evolutionary Processors
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.
KeywordsOutput Node Regular Language Mathematical Linguistics Hybrid Network Underlying Graph
Unable to display preview. Download preview PDF.
- 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
- 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
- 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
- 13.Hillis, W.D.: The Connection Machine, MIT Press, Cambridge, 1985.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