On strong reversibility in P systems and related problems

DOI10.1142/S0129054111007782MaRDI QIDQ3076593zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

decision problemsdirect predecessors of a configurationPresburger formulareversal-bounded multicounter machinesemilinear setstrongly reversible

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(12)

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

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)