Reversibility and determinism in sequential multiset rewriting

Authors:
Artiom Alhazov;Rudolf Freund;Kenichi Morita
Affiliations:
IEC, Department of Information Engineering, Graduate School of Engineering, Hiroshima University, Higashi, Hiroshima, Japan and Institute of Mathematics and Computer Science, Academy of Sciences o ...;Faculty of Informatics, Vienna University of Technology, Vienna, Austria;IEC, Department of Information Engineering, Graduate School of Engineering, Hiroshima University, Higashi, Hiroshima, Japan
Venue:
UC'10 Proceedings of the 9th international conference on Unconventional computation
Year:
2010

Citing 10
Cited 2

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
Dual P Systems

Membrane Computing
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
On reversibility and determinism in p systems

WMC'09 Proceedings of the 10th international conference on Membrane Computing

Sequential and maximally parallel multiset rewriting: reversibility and determinism

Natural Computing: an international journal
Properties of membrane systems

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study reversibility and determinism aspects of sequential multiset processing systems, and the strong versions of these properties. Syntactic criteria are established for both strong determinism and for strong reversibility. It also shown that without control all four classes -deterministic, strongly deterministic, reversible, strongly reversibleare not universal, while allowing priorities or inhibitors the first and the third class become universal. Moreover, strongly deterministic multiset rewriting systems with priorities are also universal.