%0 Generic
%D 2004
%T P systems with tables of rules
%A Gheorghe Paun
%A Mario J. Pérez-Jiménez
%A Agustín Riscos-Núñez
%C Berlín
%I Springer Berlin / Heidelberg
%P 235-249
%R 10.1007/b98751
%S Lecture Notes in Computer Science
%U http://www.springerlink.com/content/9mgxjrruc2l6hbfu/?p=241a08f8d4ac468989ce79278c81f6c3&pi=20
%V 3113
%X In the last time, several efforts were made in order to remove the polarization of membranes from P systems with active membranes; the present paper is a contribution in this respect. In order to compensate the loss of power represented by avoiding polarizations, we introduce tables of rules: each membrane has associated several sets of rules, one of which is non-deterministically chosen in each computation step. Three universality results for tabled P systems are given, trying to use rules of as few as possible types. Then, we consider tables with obligatory rules – rules which must be applied at least once when the table is applied. Systems which use tables with at most one obligatory rule are proven to be able to solve SAT problem in linear time. Several open problems are also formulated.
%@ 978-3-540-22393-1