A parallel machine for multiset transformation and its programming style
Future Generation Computer Systems
Selected papers of the Second Workshop on Concurrency and compositionality
Small universal register machines
Theoretical Computer Science - Special issue on universal machines and computations
Journal of Computer and System Sciences
Membrane Computing: An Introduction
Membrane Computing: An Introduction
The power of communication: P systems with symport/antiport
New Generation Computing
Artificial Life Applications of a Class of P Systems: Abstract Rewriting Systems on Multisets
WMP '00 Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View
Gamma and the Chemical Reaction Model: Fifteen Years After
WMP '00 Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View
Computation: finite and infinite machines
Computation: finite and infinite machines
On small universal antiport P systems
Theoretical Computer Science
Computational power of symport/antiport: history, advances, and open problems
WMC'05 Proceedings of the 6th international conference on Membrane Computing
Theoretical Computer Science
On the properties of language classes defined by bounded reaction automata
Theoretical Computer Science
Turing computability and membrane computing
CMC'12 Proceedings of the 13th international conference on Membrane Computing
| Hi-index | 5.23 |
Maximally parallel multiset rewriting systems (MPMRS) give a convenient way to express relations between unstructured objects. The functioning of various computational devices may be expressed in terms of MPMRS (e.g., register machines and many variants of P systems). In particular, this means that MPMRS are Turing universal; however, a direct translation leads to quite a large number of rules. Like for other classes of computationally complete devices, there is a challenge to find a universal system having the smallest number of rules. In this article we present different rule minimization strategies for MPMRS based on encodings and structural transformations. We apply these strategies to the translation of a small universal register machine (Korec (1996) [9]) and we show that there exists a universal MPMRS with 23 rules. Since MPMRS are identical to a restricted variant of P systems with antiport rules, the results we obtained improve previously known results on the number of rules for those systems.