Skip to main content

Control Words of Transition P Systems

Part of the Advances in Intelligent Systems and Computing book series (AISC,volume 201)

Abstract

A new way of associating a language with the computation of a P system is considered. A label is assigned to every rule in a P system, where the labels are chosen from a finite alphabet or \(\lambda .\) We associate a string, called control word, that is obtained by concatenating the labels of the rules in the transition sequence corresponding to a computation. We study the generative capacity of such control languages comparing them with family of languages such as regular, context-free, context-sensitive and recursively enumerable languages of Chomskian hierarchy.

Keywords

  • P System
  • Finite language
  • Regular language
  • Context-free language
  • Context-sensitive language
  • Recursively enumerable language

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/978-81-322-1038-2_13
  • Chapter length: 11 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   219.00
Price excludes VAT (USA)
  • ISBN: 978-81-322-1038-2
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   279.99
Price excludes VAT (USA)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • G. Păun, Computing with membranes, Journal of Computer and System Science, 61(1), pp. 108–143,2000.

    Google Scholar 

  • G. Păun, Membrane Computing - An introduction, Springer-Verlag, Berlin, 2002.

    Google Scholar 

  • G. Păun, G. Rozenberg, A. Salomaa, Membrane computing with an external output, Fundamenta Informaticae, 41(3), pp. 313–340,2000.

    Google Scholar 

  • M. Oswald, P Automata, PhD Thesis, TU Viena, 2003.

    Google Scholar 

  • E. Csuhaj-Varjú, and G. Vaszil, P Automata or Purely Communicating Accepting P Systems, Membrane Computing, International Workshop, WMC-CdeA, Curtea de Arges, Romania, August 19–23, 2002.

    Google Scholar 

  • M. Ionescu, C. Martin-Vide, G. Păun, P systems with symport/antiport rules: The traces of objects, Grammars, 5, pp. 65–79, 2002.

    Google Scholar 

  • M. Minsky, Computation - Finite and infinite Machines, Prentice Hall, Englewood Cliffs, NJ, 1967.

    Google Scholar 

  • K. Krithivasan, G. Păun and A. Ramanujan, Control Words Associated with P Systems, Frontiers of Membrane Computing: Open Problems and Research Topics by M. Gheorghe, G. Păun and M. J. Pérez-Jiménez - editors published in the second volume of the proceedings of 10th Brainstorming Week on Membrane Computing, Sevilla, 2012, 171–250.

    Google Scholar 

  • A. Ramanujan and K. Krithivasan, Control Languages of Spiking Neural P Systems, Submitted.

    Google Scholar 

  • The P System Web Page: http://ppage.psystems.eu

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ajeesh Ramanujan .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2013 Springer India

About this paper

Cite this paper

Ramanujan, A., Krithivasan, K. (2013). Control Words of Transition P Systems. In: Bansal, J., Singh, P., Deep, K., Pant, M., Nagar, A. (eds) Proceedings of Seventh International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA 2012). Advances in Intelligent Systems and Computing, vol 201. Springer, India. https://doi.org/10.1007/978-81-322-1038-2_13

Download citation

  • DOI: https://doi.org/10.1007/978-81-322-1038-2_13

  • Published:

  • Publisher Name: Springer, India

  • Print ISBN: 978-81-322-1037-5

  • Online ISBN: 978-81-322-1038-2

  • eBook Packages: EngineeringEngineering (R0)