On strong reversibility in P systems and related problems

DOI10.1142/S0129054111007782zbMATH Open1213.68272OpenAlexW1982538764MaRDI QIDQ3076593FDOQ3076593

Authors: 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

Recommendations

• On reversibility and determinism in P systems
• Reversing computation in membrane systems
• Dual P Systems
• Reversing steps in membrane systems computations
• scientific article; zbMATH DE number 1738655

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)

Cites Work

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

Cited In (12)

• Dual P Systems
• Simulating reversible computation with reaction systems
• Theory of reaction automata: a survey
• Title not available (Why is that?)
• Reversing steps in membrane systems computations
• On reversibility and determinism in P systems
• Evolutionary algorithm based on dynamical structure of membrane systems in uncertain environments
• Sequential and maximally parallel multiset rewriting: reversibility and determinism
• The predecessor-existence problem for \(k\)-reversible processes
• Properties of membrane systems
• Reversibility and determinism in sequential multiset rewriting
• The computing power of determinism and reversibility in chemical reaction automata

This page was built for publication: On strong reversibility in P systems and related problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3076593)