Advertisement

Tissue P Systems with Contextual and Rewriting Rules

  • Shankara N. Krishna
  • Kuppuswamy Lakshmanan
  • Raghavan Rama
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2597)

Abstract

The study of tissue P systems was initiated in [6], inspired from the way neurons cooperate, processing impulses in the complex net established by synapses. These systems use multisets of objects for processing, and it was shown that computational completeness can be achieved using a small number of cells and states. In this paper, we use string objects as the underlying data structure. The control structure used is a restricted form of contextual rules and rewriting rules.

We obtain two characterizations of recursively enumerable languages using these systems: tP systems having 2 states and 2 cells as well as tP systems having 4 states and a single cell generate all recursively enumerable languages. We also discuss the relationships with ET0L and E0L languages.

Keywords

Intracellular Membrane Small Intestine Epithelial Cell Enumerable Language Molecular Computing Lipid Bilayer Vesicle 
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.
    C.S. Calude and Gh. Păun, Computing with Cells and Atoms: An Introduction to Quantum, DNA and Membrane computing, Taylor & Francis, London, 2001.Google Scholar
  2. 2.
    S.N. Krishna, K. Lakshmanan, and R. Rama, Hybrid P Systems, Romanian Journal of Information Science and Technology, 4, 1–2(2001), 111–123.Google Scholar
  3. 3.
    W.R. Loewenstein, The Touchstone of Life. Molecular Information, Cell Communication, and the Foundations of Life, Oxford Univ. Press, New York, Oxford, 1999.Google Scholar
  4. 4.
    C. Martin-Vide, J. Miquel-Verges, and Gh. Păun, Contextual Grammars with Depth-first Derivation, Tenth Twente Workshop on Language Technology; Algebraic Methods in Language Processing, Twente, 1995, 225–233.Google Scholar
  5. 5.
    C. Martin-Vide, A. Mateescu, and Gh. Păun, Hybrid Grammars: The Chomsky-Marcus Case, Bulletin of EATCS, 64 (Febr. 1998), 159–165.Google Scholar
  6. 6.
    C. MartinVide, Gh. Păun, J. Pazos, and A. Rodriguez Paton, Tissue P Systems, Turku Center for Computer Science-TUCS Report No 421, http://www.tucs., Sept. 2001.
  7. 7.
    Gh. Păun, Marcus Contextual Grammars, Kluwer Academic Publishers, 1997.Google Scholar
  8. 8.
    Gh. Păun, Computing with Membranes, Journal of Computer and System Sciences, 61, 1 (2000), 108–143.MathSciNetzbMATHCrossRefGoogle Scholar
  9. 9.
    G. Rozenberg and A. Salomaa, The Mathematical Theory of L Systems, Academic Press, New York, 1980.zbMATHGoogle Scholar
  10. 10.
    G. Rozenberg and A. Salomaa, eds., Handbook of Formal Languages, 3 volumes, Springer-Verlag, Berlin, 1997.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Shankara N. Krishna
    • 1
  • Kuppuswamy Lakshmanan
    • 1
  • Raghavan Rama
    • 1
  1. 1.Department of MathematicsIndian Institute of Technology MadrasChennaiIndia

Personalised recommendations