|
| << previous | next >> |
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
Details for article 16 of 25 found articles
| Title: |
On the Branching Complexity of P Systems |
| Author: |
Ciobanu, Gabriel Păun, Gheorghe Pérez-Jiménez, Mario J. |
| Appeared in: |
Fundamenta informaticae |
| Paging: | Volume 73 (2006) nr. 1-2 pages 27-36 |
| Year: |
2006-08-28 |
| Contents: |
We consider two complexity parameters related to the graph of reachable configurations of a given P system, namely the outdegree as a measure of the degree of non-determinism, and the indegree as a measure of the degree of confluence. These parameters can be defined for both the generative and the accepting mode of using a P system. We investigate here these parameters in what concerns hierarchies and decidability issues. We prove that all hierarchies have only two levels and that all considered decidability problems have a negative answer. |
| Publisher: |
IOS Press |
| Source file: |
Elektronische Wetenschappelijke Tijdschriften |
Details for article 16 of 25 found articles
| << previous | next >> |