Name
Abstract | ||
|---|---|---|
In this article we introduce the regulating mechanism of control languages for the application of rules assigned to the membranes of a sequential P system and the variant of time-varying sets of rules available at different transition steps. Computational completeness can only be achieved when allowing the system to have no rules applicable for a bounded number of steps; in this case we only need one membrane and periodically available sets of non-cooperative rules, i.e., time-varying sequential P systems. On the other hand, even with an arbitrary number of membranes and regular control languages, only Parikh sets of matrix languages can be obtained if the terminal result has to be taken as soon as the system cannot apply any rule anymore. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/978-3-642-36751-9_9 | Int. Conf. on Membrane Computing |
Keywords | Field | DocType |
computational completeness,regular control language,parikh set,bounded number,sequential p system,arbitrary number,different transition step,control language,available set,time-varying set | Discrete mathematics,Matrix (mathematics),Completeness (statistics),Mathematics,Bounded function,P system | Conference |
Citations | PageRank | References |
6 | 0.72 | 13 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Artiom Alhazov | 1 | 642 | 68.17 |
| Rudolf Freund | 2 | 1000 | 109.64 |
| Hilbert Heikenwälder | 3 | 6 | 0.72 |
| Marion Oswald | 4 | 320 | 30.27 |
| Yurii Rogozhin | 5 | 517 | 49.01 |
| Sergey Verlan | 6 | 415 | 45.40 |