Skip to main content

String Rewriting Sequential P-Systems and Regulated Rewriting

  • Conference paper
  • First Online:
Developments in Language Theory (DLT 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2295))

Included in the following conference series:

Abstract

We investigate the computational power of generalized P-systems of specific types in comparison with the computational power of certain control mechanisms for string rewriting grammars.An important restriction dwells in using sets of operators instead of multisets within sequential P-systems; this restriction is shown to be substantial, i.e., sequential P-systems of specific type using multisets are more powerful than the corresponding sequential P-systems using only sets.

Research supported by the Czech-Austrian Aktion projekt No. 28p9 and by the Grant Agency of Czech Republic, grant No. 201/98/P047

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Dassow, J., Păun, Gh.: Regulated Rewriting in Formal Language Theory. Springer-Verlag, Berlin Heidelberg NewYork (1989)

    Google Scholar 

  2. Dassow, J., Păun, Gh.: On the power of membrane computing. Journal of Universal Computer Science 5, 2 (1999) 33–49 (http://www.iicm.edu/jucs)

    MathSciNet  Google Scholar 

  3. Freund, R.: Generalized P-systems. Fundamentals of Computation Theory, FCT’99, Iasi, 1999. In: Ciobanu, G., Păun, Gh. (eds.): Lecture Notes in Computer Science, Vol. 1684. Springer-Verlag, Berlin Heidelberg NewYork (1999) 281–292

    Chapter  Google Scholar 

  4. Păun, Gh.: Computing with Membranes. Journal of Computer and System Sciences 61, 1 (2000) 108–143

    Article  MathSciNet  MATH  Google Scholar 

  5. Păun, Gh.: Computing with Membranes: An Introduction. Bulletin EATCS 67 (Febr. 1999) 139–152

    Google Scholar 

  6. Sosík, P., Freund, R.: String Rewriting Sequential P-systems and Regulated Rewriting. Techn. Report, TUWien (2001).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sosík, P., Freund, R. (2002). String Rewriting Sequential P-Systems and Regulated Rewriting. In: Kuich, W., Rozenberg, G., Salomaa, A. (eds) Developments in Language Theory. DLT 2001. Lecture Notes in Computer Science, vol 2295. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46011-X_34

Download citation

  • DOI: https://doi.org/10.1007/3-540-46011-X_34

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43453-5

  • Online ISBN: 978-3-540-46011-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics