Nothing Special   »   [go: up one dir, main page]

Skip to main content

Bridging Deterministic P Systems and Conditional Grammars

  • Conference paper
  • First Online:
Membrane Computing (CMC 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9504))

Included in the following conference series:

Abstract

We continue the line of research of deterministic parallel non-cooperative multiset rewriting with control. We here generalize control, i.e., rule applicability context conditions, from promoters and inhibitors, which are checking presence or absence of certain objects up to some bound, to regular and even stronger predicates, focusing on predicates over the multiplicity of one symbol at a time.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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 EPUB and 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

Similar content being viewed by others

Notes

  1. 1.

    The meaning of a promoter-set in [7] is different, but the results on the computational power are equivalent up to the descriptional complexity parameters such as number of promoters/inhibitors and their weights.

References

  1. Alhazov, A., Ciubotaru, C., Ivanov, S., Rogozhin, Y.: The family of languages generated by non-cooperative membrane systems. In: Gheorghe, M., Hinze, T., Păun, Gh., Rozenberg, G., Salomaa, A. (eds.) CMC 2010. LNCS, vol. 6501, pp. 65–80. Springer, Heidelberg (2010)

    Google Scholar 

  2. Alhazov, A., Freund, R.: Asynchronous and maximally parallel deterministic controlled non-cooperative P systems characterize NFIN and coNFIN. In: Csuhaj-Varjú, E., Gheorghe, M., Rozenberg, G., Salomaa, A., Vaszil, G. (eds.) CMC 2012. LNCS, vol. 7762, pp. 101–111. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  3. Alhazov, A., Freund, R.: Deterministic non-cooperative P systems with strong context conditions. In: 13th Brainstorming Week on Membrane Computing (2015, to appear)

    Google Scholar 

  4. Alhazov, A., Freund, R.: P Systems with toxic objects. In: [11], pp. 99–125

    Google Scholar 

  5. Alhazov, A., Freund, R.: Priorities, promoters and inhibitors in deterministic non-cooperative P systems. In: [11], pp. 86–98

    Google Scholar 

  6. Alhazov, A., Freund, R.: Small P systems defining non-semilinear sets. In: Adamatzky, A. (ed.) Automata, Universality, Computation. ECC, vol. 12, pp. 183–217. Springer, Heidelberg (2015)

    Google Scholar 

  7. Alhazov, A., Freund, R., Verlan, S.: Promoters and inhibitors in purely catalytic P systems. In: [11], pp. 126–138

    Google Scholar 

  8. Alhazov, A., Sburlan, D.: Ultimately confluent rewriting systems. Parallel multiset–rewriting with permitting or forbidding contexts. In: Mauri, G., Păun, Gh., Jesús Pérez-Jímenez, M., Rozenberg, G., Salomaa, A. (eds.) WMC 2004. LNCS, vol. 3365, pp. 178–189. Springer, Heidelberg (2005)

    Google Scholar 

  9. Dassow, J., Păun, Gh.: Regulated Rewriting in Formal Language Theory. Monographs in Theoretical Computer Science. An EATCS Series, vol. 18. Springer, Heidelberg (1989)

    Google Scholar 

  10. Gheorghe, M., Păun, Gh., Pérez-Jiménez, M.J., Rozenberg, G.: Research frontiers of membrane computing: open problems and research topics. Int. J. Found. Comput. Sci. 24(5), 547–624 (2013)

    Google Scholar 

  11. Gheorghe, M., Rozenberg, G., Salomaa, A., Sosík, P., Zandron, C. (eds.): CMC 2014. LNCS, vol. 8961. Springer, Heidelberg (2014)

    MATH  Google Scholar 

  12. Ionescu, M., Sburlan, D.: On P systems with promoters/inhibitors. J. Univers. Comput. Sci. 10(5), 581–599 (2004)

    MathSciNet  Google Scholar 

  13. Klejn, H.C.M., Rozenberg, G.: A study in parallel rewriting systems. Inf. Control 44, 134–163 (1980)

    Article  Google Scholar 

  14. Păun, Gh.: Computing with membranes. J. Comput. Syst. Sci. 61(1), 108–143 (2000). and Turku Center for Computer Science-TUCS Report 208, November 1998, www.tucs.fi

  15. Păun, Gh.: Membrane Computing. An Introduction. Springer, Heidelberg (2002)

    Google Scholar 

  16. Păun, Gh., Rozenberg, G., Salomaa, A. (eds.): The Oxford Handbook of Membrane Computing. Oxford University Press, New York (2010)

    Google Scholar 

  17. Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages, vol. 3. Springer, Heidelberg (1997)

    MATH  Google Scholar 

  18. Sburlan, D.: Further results on P systems with promoters/inhibitors. Int. J. Found. Comput. Sci. 17(1), 205–221 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  19. The P Systems Website: ppage.psystems.eu

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Rudolf Freund .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Alhazov, A., Freund, R., Verlan, S. (2015). Bridging Deterministic P Systems and Conditional Grammars. In: Rozenberg, G., Salomaa, A., Sempere, J., Zandron, C. (eds) Membrane Computing. CMC 2015. Lecture Notes in Computer Science(), vol 9504. Springer, Cham. https://doi.org/10.1007/978-3-319-28475-0_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-28475-0_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-28474-3

  • Online ISBN: 978-3-319-28475-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics