Back to Search
Start Over
ON STRONG REVERSIBILITY IN P SYSTEMS AND RELATED PROBLEMS.
- Source :
-
International Journal of Foundations of Computer Science . Jan2011, Vol. 22 Issue 1, p7-14. 8p. - Publication Year :
- 2011
-
Abstract
- We consider transition P systems as originally defined in the seminal paper of Gh. Păun, where he introduced the field of membrane computing. We show that it is decidable to determine, given a P system Π, whether it is strongly reversible (i.e., every configuration has at most one direct predecessor), resolving in the affirmative a recent open problem in the field. We also show that the set of all direct predecessors of a given configuration in a P system is an effectively computable semilinear set, which can effectively be expressed as a Presburger formula, strengthening an early result in the literature. We also prove other related results. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 01290541
- Volume :
- 22
- Issue :
- 1
- Database :
- Academic Search Index
- Journal :
- International Journal of Foundations of Computer Science
- Publication Type :
- Academic Journal
- Accession number :
- 57512910
- Full Text :
- https://doi.org/10.1142/S0129054111007782