Computing Backwards with P Systems

Abstract

Searching all the configurations C′ such that produce a given configuration C, or, in other words, computing backwards in Membrane Computing is an extremely hard task. The current approximations are based in heavy hand-made calculus by considering the specific features of the given configuration. In this paper we present a general method for characterizing all the configurations C′ such that produce a given configuration C in transition P systems without cooperation and without dissolution.