Presentation
(Ultimately Confluent) Parallel Multiset-Rewriting Systems with Context
Author/s | Alhazov, Artiom
Sburlan, Dragos |
Publication Date | 2004 |
Deposit Date | 2016-02-11 |
Published in |
|
ISBN/ISSN | 84-688-6101-4 |
Abstract | The aim of this paper is to study the power of parallel multiset-
rewriting systems with permitting context (or P systems with non-cooperative
rules with promoters). The main result obtained is that if we use promoters
of ... The aim of this paper is to study the power of parallel multiset- rewriting systems with permitting context (or P systems with non-cooperative rules with promoters). The main result obtained is that if we use promoters of weight two, then the system is universal. Moreover, the construction satis¯es a special property we de¯ne: it is ulti- mately con°uent. This means that if the system allows at least one halting computation, then its ¯nal con¯guration is reachable from any reachable con- ¯guration. |
Files | Size | Format | View | Description |
---|---|---|---|---|
ULT228.pdf | 138.0Kb | [PDF] | View/ | |