Ponencia
On P Systems with Promoters/Inhibitors
Autor/es | Ionescu, Mihai
Sburlan, Dragos |
Fecha de publicación | 2004 |
Fecha de depósito | 2016-02-23 |
Publicado en |
|
ISBN/ISSN | 84-688-6101-4 |
Resumen | This article shows how the computational universality can be
reached by using P systems with object rewriting context-free rules, promot-
ers/inhibitors and one catalyst. Both generative and accepting cases are stud-
ied. ... This article shows how the computational universality can be reached by using P systems with object rewriting context-free rules, promot- ers/inhibitors and one catalyst. Both generative and accepting cases are stud- ied. Some examples that illustrate the theoretical issues are also presented. |