Skip to main content

Sequential P Systems with Regular Control

  • Conference paper
Membrane Computing (CMC 2012)

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

Included in the following conference series:

Abstract

In this article we introduce the regulating mechanism of control languages for the application of rules assigned to the membranes of a sequential P system and the variant of time-varying sets of rules available at different transition steps. Computational completeness can only be achieved when allowing the system to have no rules applicable for a bounded number of steps; in this case we only need one membrane and periodically available sets of non-cooperative rules, i.e., time-varying sequential P systems. On the other hand, even with an arbitrary number of membranes and regular control languages, only Parikh sets of matrix languages can be obtained if the terminal result has to be taken as soon as the system cannot apply any rule anymore.

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. Cavaliere, M., Freund, R., Oswald, M., Sburlan, D.: Multiset random context grammars, checkers, and transducers. Theor. Comput. Sci. 372(2-3), 136–151 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  2. Csuhaj-Varjú, E., Dassow, J., Kelemen, J., Păun, G.: Grammar Systems: A Grammatical Approach to Distribution and Cooperation. Gordon and Breach (1994)

    Google Scholar 

  3. Dassow, J.: Subregularly controlled derivations: the context-free case. Rostocker Mathematisches Kolloquium 34, 61–70 (1988)

    MathSciNet  MATH  Google Scholar 

  4. Dassow, J.: Subregularly controlled derivations: restrictions by syntactic parameters. In: Where Mathematics, Computer Science, Linguistics and Biology Meet, pp. 51–61. Kluwer Academic Publishers (2001)

    Google Scholar 

  5. Dassow, J.: Subregular restrictions for some language generating devices. In: Freund, R., Holzer, M., Truthe, B., Ultes-Nitsche, U. (eds.) Fourth Workshop on Non-Classical Models for Automata and Applications, NCMA 2012, Fribourg, Switzerland, August 23-24, vol. 290, pp. 11–26 (2012), books@ocg.at

    Google Scholar 

  6. Dassow, J., Păun, G.: Regulated Rewriting in Formal Language Theory. Springer (1989)

    Google Scholar 

  7. Dassow, J., Păun, G., Rozenberg, G.: Grammar systems. In: [18], vol. 2, pp. 155–172 (1997)

    Google Scholar 

  8. Dassow, J., Păun, G., Salomaa, A.: Grammars with controlled derivations. In: [18], vol. 2, pp. 101–154 (1997)

    Google Scholar 

  9. Fernau, H.: Unconditional transfer in regulated rewriting. Acta Informatica 34(11), 837–857 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  10. Freund, R., Kari, L., Oswald, M., Sosík, P.: Computationally universal P systems without priorities: two catalysts are sufficient. Theor. Comp. Sci. 330, 251–266 (2005)

    Article  MATH  Google Scholar 

  11. Kudlek, M., Martín-Vide, C., Păun, G.: Toward a Formal Macroset Theory. In: Calude, C.S., Pun, G., Rozenberg, G., Salomaa, A. (eds.) Multiset Processing. LNCS, vol. 2235, pp. 123–134. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  12. Margenstern, M., Rogozhin, Y.: About Time-Varying Distributed H Systems. In: Condon, A., Rozenberg, G. (eds.) DNA 2000. LNCS, vol. 2054, pp. 53–62. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  13. Minsky, M.L.: Computation: Finite and Infinite Machines. Prentice Hall (1967)

    Google Scholar 

  14. Nielsen, M.: OL systems with control devices. Acta Informatica 4(4), 373–386 (1975)

    Article  MATH  Google Scholar 

  15. Păun, G.: DNA computing: Distributed Splicing Systems. In: Mycielski, J., Rozenberg, G., Salomaa, A. (eds.) Structures in Logic and Computer Science. LNCS, vol. 1261, pp. 353–370. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  16. Păun, G.: Membrane Computing. An Introduction. Springer (2002)

    Google Scholar 

  17. Păun, G., Rozenberg, G., Salomaa, A.: The Oxford Handbook of Membrane Computing. Oxford University Press (2010)

    Google Scholar 

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

    Google Scholar 

  19. Salomaa, A.: On finite automata with a time-variant structure. Information and Control 13(2), 85–98 (1968)

    Article  MathSciNet  MATH  Google Scholar 

  20. Salomaa, A.: Periodically time-variant context-free grammars. Information and Control 17, 294–311 (1970)

    Article  MathSciNet  MATH  Google Scholar 

  21. The P Systems Web Page, http://ppage.psystems.eu

  22. Verlan, S.: Communicating Distributed H Systems with Alternating Filters. In: Jonoska, N., Păun, G., Rozenberg, G. (eds.) Aspects of Molecular Computing. LNCS, vol. 2950, pp. 367–384. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Alhazov, A., Freund, R., Heikenwälder, H., Oswald, M., Rogozhin, Y., Verlan, S. (2013). Sequential P Systems with Regular Control. In: Csuhaj-Varjú, E., Gheorghe, M., Rozenberg, G., Salomaa, A., Vaszil, G. (eds) Membrane Computing. CMC 2012. Lecture Notes in Computer Science, vol 7762. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36751-9_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-36751-9_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-36750-2

  • Online ISBN: 978-3-642-36751-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics