A new class of symbolic abstract neural nets

Starting from the way the inter-cellular communication takes place by means of protein channels and also from the standard knowledge about neuron functioning, we propose a computing model called a tissue P system, which processes symbols in a multiset rewriting sense, in a net of cells similar to a neural net. Each cell has a finite state memory, processes multisets of symbol-impulses, and can send impulses (?excitations?) to the neighboring cells. Such cell nets are shown to be rather powerful: they can simulate a Turing machine even when using a small number of cells, each of them having a small number of states. Moreover, in the case when each cell works in the maximal manner and it can excite all the cells to which it can send impulses, then one can easily solve the Hamiltonian Path Problem in linear time. A new characterization of the Parikh images of ET0L languages are also obtained in this framework

Bibliography

Introduction to Formal Language Theory", Addison-Wesley. [Hop79] Hopcroft J.E., Ullman J.D. (1979), "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley. [Ho65] Hotz G. (1965), "Eine Algebraisierung des Syntheseproblems von Schaltkreisen", EIK 1, 185--205, 209--231. [Ho66] Hotz G. (1966), "Eindeutigkeit und Mehrdeutigkeit formaler Sprachen" , EIK 2, 235--246. [Ho67] Hotz G. (1967), "Erzeugung formaler Sprachen durch gekoppelte Ersetzungen", 4. Colloquium uber Automatentheorie, ed. by F.L. Bauer, K. Samelson, Math. Institut der TH Munchen, 62--73. [HoCl72] Hotz G., Claus V. (1972), "Automatentheorie und Formale Sprachen III" , B.I.- Wissenschaftsverlag, Mannheim. [Ho74] Hotz G. (1974), "Schaltkreistheorie", de Gruyter, Berlin. [Ho90] Hotz G. (1990), "Einfuhrung in die Informatik", Teubner, Stuttgart. [Jo85] Joshi A. (1985), "An introduction to Tree Adjoining Grammars", Technical report, University of Pennsylvani