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
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Cavaliere, M., Freund, R., Oswald, M., Sburlan, D.: Multiset random context grammars, checkers, and transducers. Theor. Comput. Sci. 372(2-3), 136–151 (2007)
Csuhaj-Varjú, E., Dassow, J., Kelemen, J., Păun, G.: Grammar Systems: A Grammatical Approach to Distribution and Cooperation. Gordon and Breach (1994)
Dassow, J.: Subregularly controlled derivations: the context-free case. Rostocker Mathematisches Kolloquium 34, 61–70 (1988)
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)
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
Dassow, J., Păun, G.: Regulated Rewriting in Formal Language Theory. Springer (1989)
Dassow, J., Păun, G., Rozenberg, G.: Grammar systems. In: [18], vol. 2, pp. 155–172 (1997)
Dassow, J., Păun, G., Salomaa, A.: Grammars with controlled derivations. In: [18], vol. 2, pp. 101–154 (1997)
Fernau, H.: Unconditional transfer in regulated rewriting. Acta Informatica 34(11), 837–857 (1997)
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)
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)
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)
Minsky, M.L.: Computation: Finite and Infinite Machines. Prentice Hall (1967)
Nielsen, M.: OL systems with control devices. Acta Informatica 4(4), 373–386 (1975)
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)
Păun, G.: Membrane Computing. An Introduction. Springer (2002)
Păun, G., Rozenberg, G., Salomaa, A.: The Oxford Handbook of Membrane Computing. Oxford University Press (2010)
Rozenberg, G., Salomaa, A.: Handbook of Formal Languages, vol. 3. Springer (1997)
Salomaa, A.: On finite automata with a time-variant structure. Information and Control 13(2), 85–98 (1968)
Salomaa, A.: Periodically time-variant context-free grammars. Information and Control 17, 294–311 (1970)
The P Systems Web Page, http://ppage.psystems.eu
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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)