Earlier solutions to decision problems by means of P systems used many counter objects to control the synchronization of different stages in a computation (usually as many counters as the stage must last in the worst case). In this paper we propose a way to replace those counters with some spacial objects for each stage. Furthermore, following the ideas presented in [1], in order to have a common scheme to attack numerical problems, all instances of a problem with the same size are solved by the same P system (which depends on the size) given an input which describes the corresponding instance of the problem. We illustrate these ideas with a cellular solution to the Subset-Sum problem. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Graciani-Díaz, C., & Riscos-Núñez, A. (2005). Looking for simple common schemes to design recognizer P systems with active membranes that solve numerical decision problems. In Lecture Notes in Computer Science (Vol. 3699, pp. 94–104). Springer Verlag. https://doi.org/10.1007/11560319_10
Mendeley helps you to discover research relevant for your work.