ON STRONG REVERSIBILITY IN P SYSTEMS AND RELATED PROBLEMS

DOI10.1142/S0129054111007782zbMath1213.68272MaRDI 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 problems; semilinear set; Presburger formula; strongly reversible; reversal-bounded multicounter machine; direct predecessors of a configuration

Mathematics Subject Classification ID

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

Related Items

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

Cites Work

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