Name
Abstract | ||
|---|---|---|
We continue the investigation of the power of the computability models introduced in [Gh. Paun, Computing with membranes, TUCS Report 208, November 1998] under the name of transition super-cell systems. We compare these systems with classic mechanisms in formal language theory, context-free and matrix grammars, E0L and ET0L systems, interpreted as generating mechanisms of number relations (we take the Parikh image of the usual language generated by these mechanisms rather than the language). Several open problems are also formulated. |
Year | Venue | Keywords |
|---|---|---|
1999 | J. UCS | natural computing,chomsky hierarchy,l systems,membrane computing |
DocType | Volume | Issue |
Journal | 5 | 2 |
Citations | PageRank | References |
38 | 15.05 | 3 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jürgen Dassow | 1 | 530 | 118.27 |
| Gheorghe Paun | 2 | 2840 | 369.48 |