[Zurück]

P. Sosik, R. Freund:
" String Rewriting Sequential P-Systems and Regulated Rewriting";
in: "Developments in Language Theory", herausgegeben von: Werner Kuich, Grzegorz Rozenberg, Arto Salomaa; Springer, 2002, ISBN: 3-540-43453-4, S. 379 - 388.

We investigate the computational power of generalized
P-systems of specific types in comparison with the computational power of
certain control mechanisms for string rewriting grammars. An important
restriction dwells in using sets of operators instead of multisets within
sequential P-systems; this restriction is shown to be substantial, i.e.,
sequential P-systems of specific type using multisets are more powerful than
the corresponding sequential P-systems using only sets.