Abstract
A membrane system (P system) is a model of computation inspired by some basic features of the structure and behaviour of living cells. In this paper we consider systems with string-objects processed by rewriting, with the communication controlled by conditions on the contents of the strings. Symbols, substrings (in an arbitrary place, or as a prefix/suffix), or the shape of the whole string are used as permitting and as forbidding conditions when moving strings from a membrane to a neighboring membrane. Many of the obtained variants lead to new characterizations of recursively enumerable languages (as expected, these characterizations indicate a trade-off between the number of membranes and the strength of the communication conditions used). Several open problems are also formulated.
Work supported by a grant of NATO Science Committee, Spain, 2000–2001, and by the Visiting professor programme of the University “La Sapienza” of Rome, Italy
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
D. Angluin, Finding Patterns Common to a Set of Strings, J. Comput. System Sci., 21 (1980), 46–62.
P. Bottoni, A. Labella, P. Mussio, Gh. Păun, Pattern Control on Derivation in Context-Free Rewriting, J. Automata, Languages, Combinatorics, 3, 1, (1998), 3–28.
P. Bottoni, C. Martin-Vide, Gh. Păun, G. Rozenberg, Membrane Systems with Promoters/Inhibitors, submitted, 2000.
C. Calude, Gh. Păun, Computing with Cells and Atoms, Taylor and Francis, London, 2000.
J. Castellanos, A. Rodriguez-Paton, Gh. Păun, Computing with Membranes: P Systems with Worm-Objects, IEEE 7th. Intern. Conf. on String Processing and Information Retrieval, SPIRE 2000, La Coruna, Spain, 64–74.
J. Dassow, Gh. Păun, Regulated Rewriting in Formal Language Theory, Springer-Verlag, Berlin, 1989.
J. Dassow, Gh. Păun, A. Salomaa, Grammars Based on Patterns, Intern. J. Found. Comput. Sci., 4, 1 (1993), 1–14.
R. Freund, C. Martin-Vide, Gh. Păun, Computing with Membranes: Three More Collapsing Hierarchies, submitted, 2000.
R. Freund, Gh. Păun, On the Number of Non-terminals in Graph-Controlled, Programmed, and Matrix Grammars, submitted, 2000.
D. Hauschild, M. Jantzen, Petri Nets Algorithms in the Theory of Matrix Grammars, Acta Informatica, 31 (1994), 719–728.
S.N. Krishna, R. Rama, On the Power of P Systems with Sequential and Parallel Rewriting, Intern. J. Computer Math., 77, 1–2 (2000), 1–14.
S.N. Krishna, R. Rama, P Systems with Replicated Rewriting, J. Automata, Languages, Conbinatorics, to appear.
C. Martin-Vide, Gh. Păun, String Objects in P Systems, Proc. of Algebraic Systems, Formal Languages and Computations Workshop, Kyoto, 2000, RIMS Kokyuroku, Kyoto Univ., 2000.
C. Martin-Vide, Gh. Păun, Computing with Membranes. One More Collapsing Hierarchy, Bulletin of the EATCS, 72 (2000).
V. Mitrana, Patterns and Languages. An Overview, Grammars, 2, 2 (1999), 149–173.
Gh. Păun, Six Nonterminals Are Enough for Generating Each r.e. Language by a Matrix Grammar, Intern. J. Computer Math., 15 (1984), 23–37.
Gh. Păun, Computing with Membranes, Journal of Computer and System Sciences, 61, 1 (2000), 108–143 (see also Turku Center for Computer Science-TUCS Report No 208, 1998, http://www.tucs.fi).
Gh. Păun, Computing with Membranes; Attacking NP-complete Problems, Proc. Second Conf. Unconventional Models of Computing (I. Antoniou, C.S. Calude, M.J. Dinneen, Eds.), Springer-Verlag, 2000.
G. Rozenberg, A. Salomaa, Eds., Handbook of Formal Languages, Springer-Verlag, Heidelberg, 1997.
Cl. Zandron, G. Mauri, Cl. Ferretti, Universality and Normal Forms on Membrane Systems, Proc. Intern. Workshop Grammar Systems 2000 (R. Freund, A. Kelemenova, Eds.), Bad Ischl, Austria, July 2000, 61–74.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Bottoni, P., Labella, A., Martín-Vide, C., PĂun, G. (2002). Rewriting P Systems with Conditional Communication. In: Brauer, W., Ehrig, H., Karhumäki, J., Salomaa, A. (eds) Formal and Natural Computing. Lecture Notes in Computer Science, vol 2300. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45711-9_18
Download citation
DOI: https://doi.org/10.1007/3-540-45711-9_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43190-9
Online ISBN: 978-3-540-45711-4
eBook Packages: Springer Book Archive