Abstract
The aim of this paper is to study the power of parallel multiset-rewriting systems with permitting or forbidding context (or P systems with non-cooperative rules with promoters or inhibitors). The main results obtained are those if we use promoters or inhibitors of weight two, then the systems are computational universal.
Moreover, both constructions satisfy a special property we define: they are ultimately confluent. This means that if the system allows at least one halting computation, then their final configurations are reachable from any reachable configuration. The other property both constructions satisfy is that a system allowing at least one halting computation will halt with probability 1.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bottoni, P., Martín-Vide, C., Păun, G., Rozenberg, G.: Membrane Systems with Promoters/Inhibitors. Acta Informatica 38(10), 695–720 (2002)
Ionescu, M., Sburlan, D.: On P Systems with Promoters/Inhibitors. JUCS 10(5), 581–599 (2004)
Păun, G.: Computing with Membranes: An Introduction. Springer, Berlin (2002)
Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages. Springer, Berlin (1997)
Sburlan, D.: New Results on P Systems with Multiset Promoted/Inhibited Rules. In: PAMM 2004, Balaton-Almady, Hungary (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alhazov, A., Sburlan, D. (2005). Ultimately Confluent Rewriting Systems. Parallel Multiset–Rewriting with Permitting or Forbidding Contexts. In: Mauri, G., Păun, G., Pérez-Jiménez, M.J., Rozenberg, G., Salomaa, A. (eds) Membrane Computing. WMC 2004. Lecture Notes in Computer Science, vol 3365. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31837-8_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-31837-8_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25080-7
Online ISBN: 978-3-540-31837-8
eBook Packages: Computer ScienceComputer Science (R0)