<div class="csl-bib-body">
<div class="csl-entry">Alhazov, A., Freund, R., & Morita, K. (2012). Sequential and maximally parallel multiset rewriting: reversibility and determinism. <i>Natural Computing</i>, <i>11</i>(1), 95–106. https://doi.org/10.1007/s11047-011-9267-8</div>
</div>
-
dc.identifier.issn
1567-7818
-
dc.identifier.uri
http://hdl.handle.net/20.500.12708/163855
-
dc.description.abstract
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.
en
dc.language.iso
en
-
dc.publisher
SPRINGER
-
dc.relation.ispartof
Natural Computing
-
dc.subject
Computer Science Applications
en
dc.subject
Multiset processing
en
dc.subject
Inhibitors
en
dc.subject
Priorities
en
dc.subject
P systems
en
dc.subject
Reversibility
en
dc.subject
Determinism
en
dc.subject
Decidability
en
dc.subject
Universality
en
dc.title
Sequential and maximally parallel multiset rewriting: reversibility and determinism