A MzScheme Implementation of Transition P Systems

  • Delia Balbontín Noval
  • Mario J. Pérez Jiménez
  • Fernando Sancho Caparrini
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2597)

Abstract

The main goal of this paper is to present the design of an MzScheme program that allows us to simulate the behavior of transition P systems. For that, a library of procedures have been developed that work in two stages. In the first one, the parsing/compiling stage, the input P system is checked, and if it is well defined, then it is represented by means of an internal grammar. In a second stage, the simulation, the computation tree associated to the P system is generated until a prefixed level.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Gh. Păun, Computing with membranes, Journal of Computer and System Sciences, 61, 1 (2000), 108–143, and Turku Center for Computer Science-TUCS Report No 208, 1998 (http://www.tucs.fi).MathSciNetMATHCrossRefGoogle Scholar
  2. 2.
    Gh. Păun, G. Rozenberg, A guide to membrane computing, Theoretical Computer Science, 287, 1 (2002), 73–100.MathSciNetMATHCrossRefGoogle Scholar
  3. 3.
    M.J. Pérez-Jiménez, F. Sancho-Caparrini. A formalization of transition P systems. Fundamenta Informaticae, 49, 1–3 (2002), 261–272.MathSciNetMATHGoogle Scholar
  4. 4.
    M.J. Pérez-Jiménez, F. Sancho-Caparrini. Verifying a P system generating squares. Romanian Journal of Information Science and Technology, 5, 2–3 (2002), 181–191.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Delia Balbontín Noval
    • 1
  • Mario J. Pérez Jiménez
    • 1
  • Fernando Sancho Caparrini
    • 1
  1. 1.Dpto. Ciencias de la Computación e Inteligencia ArtificialUniversidad de SevillaEspaña

Personalised recommendations