Universality of a reversible two-counter machine
Theoretical Computer Science - Special issue on universal machines and computations
Regulated Rewriting in Formal Language Theory
Regulated Rewriting in Formal Language Theory
Membrane Computing: An Introduction
Membrane Computing: An Introduction
A Simple Universal Logic Element and Cellular Automata for Reversible Computing
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
Computation: finite and infinite machines
Computation: finite and infinite machines
Reversible P Systems to Simulate Fredkin Circuits
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Logical reversibility of computation
IBM Journal of Research and Development
A universal reversible turing machine
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Reversibility and determinism in sequential multiset rewriting
UC'10 Proceedings of the 9th international conference on Unconventional computation
On reversibility and determinism in p systems
WMC'09 Proceedings of the 10th international conference on Membrane Computing
Properties of membrane systems
CMC'11 Proceedings of the 12th international conference on Membrane Computing
Hi-index | 0.00 |
We study reversibility and determinism aspects and the strong versions of these properties of sequential multiset processing systems and of maximally parallel systems, from the computability point of view. In the sequential case, syntactic criteria are established for both strong determinism and strong reversibility. In the parallel case, a criterion is established for strong determinism, whereas strong reversibility is shown to be decidable. In the sequential case, without control all four classes--deterministic, strongly deterministic, reversible, strongly reversible--are not universal, whereas in the parallel case deterministic systems are universal. When allowing inhibitors, the first and the third class become universal in both models, whereas with priorities all of them are universal. In the maximally parallel case, strongly deterministic systems with both promoters and inhibitors are universal. We also present a few more specific results and conjectures.