Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
B. Alberts et al., Essential Cell Biology. An Introduction to the Molecular Biology of the Cell, Garland Publ. Inc., New York, London, 1998.
M.A. Arbib, Brains, Machines, and Mathematics, second ed., Springer-Verlag, Berlin, 1987.
M.A. Arbib, The Methaphorical Brain: An Introduction to Schemes and Brain Theory, Wiley Interscience, 1988.
J.P. Banatre, D. LeMetayer, Gamma and chemical reaction model: ten years after, in vol. Coordination Programming: Mechanisms, Models, and Semantics (C. Hankin, ed.), Imperial College Press, 1996, 3–41.
D.S. Blank et al (24 co-authors), Connectionist symbol processing: Dead or alive?, Neural Computing Surveys, 2 (1999), 1–40.
C. Choffrut, ed., Automata Networks, Lecture Notes in Computer Science, 316, Springer-Verlag, Berlin, 1988.
E. Csuhaj-Varju, C. Martin-Vide, V. Mitrana, Multiset automata, Multiset Processing (C.S. Calude, Gh. Paun, G. Rozenberg, A. Salomaa, eds), Lecture Notes in Computer Science, 2235, Springer-Verlag, 2001.
A. Dovier, A. Policriti, G. Rossi, A uniform axiomatic view of lists, multisets, and sets, and the relevant unification algorithms, Fundamenta Informaticae, 36,2–3 (1998), 201–234.
F. Gecseg, Products of Automata, Springer-Verlag, Berlin, 1986.
S.C. Kleene, Representation of events in nerve nets and finite automata, Automata Studies, Princeton Univ. Press, Princeton, N.J., 1956, 2–42.
W.R. Loewenstein, The Touchstone of Life. Molecular Information, Cell Communication, and the Foundations of Life, Oxford Univ. Press, 1999.
A. Mateescu, V. Mitrana, Parallel finite automata systems communicating by states, Intern. J. Found. Computer Sci., to appear.
W.S. McCulloch, W.H. Pitts, A logical calculus of the ideas immanent in nervous activity, Bull. Math. Biophys., 5 (1943), 115–133.
M. Minsky, Computation: Finite and Infinite Machines, Prentice-Hall, 1967.
Gh. Păun, Computing with membranes, Journal of Computer and System Sciences, 61,1 (2000), 108–143.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Martín-Vide, C., Pazos, J., Păun, G., Rodríguez-Patón, A. (2002). A New Class of Symbolic Abstract Neural Nets: Tissue P Systems. In: Ibarra, O.H., Zhang, L. (eds) Computing and Combinatorics. COCOON 2002. Lecture Notes in Computer Science, vol 2387. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45655-4_32
Download citation
DOI: https://doi.org/10.1007/3-540-45655-4_32
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43996-7
Online ISBN: 978-3-540-45655-1
eBook Packages: Springer Book Archive