Name
Abstract | ||
|---|---|---|
We investigated a variant of purely communicating P systems that are able to accept multisets or even strings given as sequences
of terminal symbols taken from the environment. We showed that such P automata with membrane channels equipped with only one
membrane and specific activating and prohibiting rules can already recognize any recursively enumerable language of multisets
and strings, respectively. Moreover, using only activating rules of a very special kind, we obtained a characterization of
regular languages. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1007/BF02678889 | Artificial Life and Robotics |
Keywords | DocType | Volume |
membrane computing �9 p automata �9 univer- sality,Membrane computing,P Automata,Universality | Journal | 8 |
Issue | ISSN | Citations |
2 | 1614-7456 | 1 |
PageRank | References | Authors |
0.36 | 5 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rudolf Freund | 1 | 1000 | 109.64 |
| Marion Oswald | 2 | 320 | 30.27 |