Advertisement

Rewriting P Systems with Conditional Communication

  • Paolo Bottoni
  • Anna Labella
  • Carlos Martín-Vide
  • Gheorghe PĂun
Chapter
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2300)

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.

Keywords

Normal Form Communication Condition Regular Language Lower Membrane Applicable Rule 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    D. Angluin, Finding Patterns Common to a Set of Strings, J. Comput. System Sci., 21 (1980), 46–62.zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    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.zbMATHGoogle Scholar
  3. 3.
    P. Bottoni, C. Martin-Vide, Gh. Păun, G. Rozenberg, Membrane Systems with Promoters/Inhibitors, submitted, 2000.Google Scholar
  4. 4.
    C. Calude, Gh. Păun, Computing with Cells and Atoms, Taylor and Francis, London, 2000.Google Scholar
  5. 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. 6.
    J. Dassow, Gh. Păun, Regulated Rewriting in Formal Language Theory, Springer-Verlag, Berlin, 1989.Google Scholar
  7. 7.
    J. Dassow, Gh. Păun, A. Salomaa, Grammars Based on Patterns, Intern. J. Found. Comput. Sci., 4, 1 (1993), 1–14.zbMATHCrossRefGoogle Scholar
  8. 8.
    R. Freund, C. Martin-Vide, Gh. Păun, Computing with Membranes: Three More Collapsing Hierarchies, submitted, 2000.Google Scholar
  9. 9.
    R. Freund, Gh. Păun, On the Number of Non-terminals in Graph-Controlled, Programmed, and Matrix Grammars, submitted, 2000.Google Scholar
  10. 10.
    D. Hauschild, M. Jantzen, Petri Nets Algorithms in the Theory of Matrix Grammars, Acta Informatica, 31 (1994), 719–728.CrossRefMathSciNetGoogle Scholar
  11. 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. 12.
    S.N. Krishna, R. Rama, P Systems with Replicated Rewriting, J. Automata, Languages, Conbinatorics, to appear.Google Scholar
  13. 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. 14.
    C. Martin-Vide, Gh. Păun, Computing with Membranes. One More Collapsing Hierarchy, Bulletin of the EATCS, 72 (2000).Google Scholar
  15. 15.
    V. Mitrana, Patterns and Languages. An Overview, Grammars, 2, 2 (1999), 149–173.zbMATHCrossRefMathSciNetGoogle Scholar
  16. 16.
    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.zbMATHCrossRefGoogle Scholar
  17. 17.
    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).CrossRefMathSciNetzbMATHGoogle Scholar
  18. 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
  19. 19.
    G. Rozenberg, A. Salomaa, Eds., Handbook of Formal Languages, Springer-Verlag, Heidelberg, 1997.zbMATHGoogle Scholar
  20. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Paolo Bottoni
    • 1
  • Anna Labella
    • 1
  • Carlos Martín-Vide
    • 2
  • Gheorghe PĂun
    • 3
  1. 1.Department of Computer ScienceUniversity of Rome “La Sapienza”RomaItaly
  2. 2.Research Group in Mathematical LinguisticsRovira i Virgili UniversityTarragonaSpain
  3. 3.Institute of Mathematics of the Romanian AcademyBucureştiRomania

Personalised recommendations