Ultimately confluent rewriting systems. parallel multiset–rewriting with permitting or forbidding contexts

Authors:
Artiom Alhazov;Dragoş Sburlan
Affiliations:
Research Group on Mathematical Linguistics, Rovira i Virgili University, Spain;Department of Informatics and Numerical Methods, Ovidius University of Constantza, Romania
Venue:
WMC'04 Proceedings of the 5th international conference on Membrane Computing
Year:
2004

Citing 2
Cited 2

Handbook of Formal Languages

Handbook of Formal Languages
Membrane Computing: An Introduction

Membrane Computing: An Introduction

Properties of membrane systems

CMC'11 Proceedings of the 12th international conference on Membrane Computing
Asynchronous and maximally parallel deterministic controlled non-cooperative p systems characterize NFIN and coNFIN

CMC'12 Proceedings of the 13th international conference on Membrane Computing

Quantified Score

Hi-index	0.00

Visualization

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.