On the computational completeness of graph-controlled insertion-deletion systems with binary sizes (Q2358685)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the computational completeness of graph-controlled insertion-deletion systems with binary sizes |
scientific article |
Statements
On the computational completeness of graph-controlled insertion-deletion systems with binary sizes (English)
0 references
15 June 2017
0 references
insertion-deletion systems
0 references
graph-controlled systems
0 references
P systems
0 references
descriptional complexity measures
0 references
computational completeness
0 references
0 references
