Rewriting P Systems with Conditional Communication
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.
KeywordsNormal Form Communication Condition Regular Language Lower Membrane Applicable Rule
Unable to display preview. Download preview PDF.
- 3.P. Bottoni, C. Martin-Vide, Gh. Păun, G. Rozenberg, Membrane Systems with Promoters/Inhibitors, submitted, 2000.Google Scholar
- 4.C. Calude, Gh. Păun, Computing with Cells and Atoms, Taylor and Francis, London, 2000.Google Scholar
- 5.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.Google Scholar
- 6.J. Dassow, Gh. Păun, Regulated Rewriting in Formal Language Theory, Springer-Verlag, Berlin, 1989.Google Scholar
- 8.R. Freund, C. Martin-Vide, Gh. Păun, Computing with Membranes: Three More Collapsing Hierarchies, submitted, 2000.Google Scholar
- 9.R. Freund, Gh. Păun, On the Number of Non-terminals in Graph-Controlled, Programmed, and Matrix Grammars, submitted, 2000.Google Scholar
- 11.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.Google Scholar
- 12.S.N. Krishna, R. Rama, P Systems with Replicated Rewriting, J. Automata, Languages, Conbinatorics, to appear.Google Scholar
- 13.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.Google Scholar
- 14.C. Martin-Vide, Gh. Păun, Computing with Membranes. One More Collapsing Hierarchy, Bulletin of the EATCS, 72 (2000).Google Scholar
- 18.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.Google Scholar
- 20.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.Google Scholar