Membrane Computing: An Introduction
Membrane Computing: An Introduction
Reversible P Systems to Simulate Fredkin Circuits
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Predecessor existence problems for finite discrete dynamical systems
Theoretical Computer Science
Reversible computing and cellular automata—A survey
Theoretical Computer Science
Reversibility and determinism in sequential multiset rewriting
UC'10 Proceedings of the 9th international conference on Unconventional computation
On reversibility and determinism in p systems
WMC'09 Proceedings of the 10th international conference on Membrane Computing
Searching previous configurations in membrane computing
WMC'09 Proceedings of the 10th international conference on Membrane Computing
| Hi-index | 0.00 |
This paper aims to answer the following question: given a P system configuration M , how do we find each configuration N such that N evolves to M in one step? While easy to state, the problem has not a simple answer. To provide a solution to this problem for a general class of P systems with simple communication rules and without dissolution, we introduce the dual P systems. Essentially these systems reverse the rules of the initial P system and find N by applying reversely valid multisets of rules. We prove that in this way we find exactly those configurations N which evolve to M in one step.