Five Nodes Are Sufficient for Hybrid Networks of Evolutionary Processors to Be Computationally Complete
A hybrid network of evolutionary processors (HNEP) is a graph where each node is associated with a special rewriting system called an evolutionary processor, an input filter, and an output filter. Each evolutionary processor is given a finite set of one type of point mutations (insertion, deletion or a substitution of a symbol) which can be applied to certain positions in a string. An HNEP rewrites the strings in the nodes and then re-distributes them according to a filter-based communication protocol; the filters are defined by certain variants of random-context conditions. HNEPs can be considered both as languages generating devices (GHNEPs) and language accepting devices (AHNEPs); most previous approaches treated the accepting and generating cases separately. For both cases, in this paper we improve previous results by showing that five nodes are sufficient to accept (AHNEPs) or generate (GHNEPs) any recursively enumerable language by showing the more general result that any partial recursive relation can be computed by an HNEP with (at most) five nodes.
Unable to display preview. Download preview PDF.
- 2.Alhazov, A., Csuhaj-Varjú, E., Martín-Vide, C., Rogozhin, Y.: Computational Completeness of Hybrid Networks of Evolutionary Processors with Seven Nodes. In: Campeanu, C., Pighizzini, G. (eds.) Descriptional Complexity of Formal Systems, Proceedings DCFS 2008, Univ. Prince Edward Island, Charlottetown, pp. 38–47 (2008)Google Scholar
- 8.Alhazov, A., Martín-Vide, C., Rogozhin, Y.: Networks of Evolutionary Processors with Two Nodes are Unpredictable. In: Pre-Proceedings of the 1st International Conference on Language and Automata Theory and Applications, LATA, GRLMC report 35/07, Rovira i Virgili University, Tarragona, 521–528 (2007)Google Scholar
- 12.Freund, R., Rogozhin, Y., Verlan, S.: Generating and Accepting P Systems with Minimal Left and Right Insertion and Deletion. Natural Computing. Springer (2014), doi:10.1007/s11047-013-9396-3Google Scholar
- 21.Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages, vol. 3. Springer (1997)Google Scholar
- 22.Salomaa, A.: Formal Languages. Academic Press, New York (1973)Google Scholar