(Ultimately Confluent) Parallel Multiset–Rewriting Systems with Context
نویسندگان
چکیده
The aim of this paper is to study the power of parallel multisetrewriting 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 satisfies a special property we define: it is ultimately confluent. This means that if the system allows at least one halting computation, then its final configuration is reachable from any reachable configuration.
منابع مشابه
Ultimately Confluent Rewriting Systems. Parallel Multiset-Rewriting with Permitting or Forbidding Contexts
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 say that 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 ar...
متن کاملMaximally Parallel Multiset-Rewriting Systems: Browsing the Configurations
The aim of this research is to produce an algorithm for the software that would let a researcher to observe the evolution of maximally parallel multiset-rewriting systems with permitting and forbidding contexts, browsing the configuration space by following transitions like following hyperlinks in the World-Wide Web. The relationships of maximally parallel multiset-rewriting systems with other ...
متن کاملParallel Admissible Graph Rewriting
We investigate the rewrite relation over graphs induced by constructor-based weakly orthogonal graph rewriting systems. It is well known that this relation is not confluent in general whereas it is confluent in the case of weakly orthogonal term rewriting systems. We show, however, that the considered relation is always confluent, as well as confluent modulo bisimilarity, for a large class of g...
متن کاملTaxonomy of In nite State ProcessesFaron
In this tutorial paper, we consider various classes of automata generated by simple rewrite transition systems. These classes are deened by two natural hierarchies, one given by interpreting concatenation of symbols in the rewrite system as sequential composition, and the other by interpreting concatenation as parallel composition. In this way we provide natural deenitions for commutative (para...
متن کاملType Checking for a Multiset Rewriting Language
We enhance Gamma, a multiset rewriting language, with a notion of structured multiset. A structured multiset is a set of addresses satisfying speci c relations which can be used in the rewriting rules of the program. A type is de ned by a context-free graph grammar and a structured multiset belongs to a type T if its underlying set of addresses satis es the invariant expressed by the grammar de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004