ON STRONG REVERSIBILITY IN P SYSTEMS AND RELATED PROBLEMS

DOI10.1142/S0129054111007782zbMath1213.68272OpenAlexW1982538764MaRDI QIDQ3076593

Oscar H. Ibarra

Publication date: 23 February 2011

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054111007782

zbMATH Keywords

decision problemssemilinear setPresburger formulastrongly reversiblereversal-bounded multicounter machinedirect predecessors of a configuration

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (8)

Properties of Membrane Systems ⋮ Deletion operations on deterministic families of automata ⋮ Insertion operations on deterministic reversal-bounded counter machines ⋮ The Computing Power of Determinism and Reversibility in Chemical Reaction Automata ⋮ Simulating reversible computation with reaction systems ⋮ Theory of reaction automata: a survey ⋮ Sequential and maximally parallel multiset rewriting: reversibility and determinism ⋮ Evolutionary algorithm based on dynamical structure of membrane systems in uncertain environments

Cites Work

• A technique for proving decidability of containment and equivalence of linear constraint queries
• Reversal-Bounded Multicounter Machines and Their Decision Problems

This page was built for publication: ON STRONG REVERSIBILITY IN P SYSTEMS AND RELATED PROBLEMS