On the computational completeness of graph-controlled insertion-deletion systems with binary sizes (Q2358685)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6731759
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the computational completeness of graph-controlled insertion-deletion systems with binary sizes |
scientific article; zbMATH DE number 6731759 |
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
0.9520489
0 references
0 references
0.90109825
0 references
0.8926708
0 references
0.88770616
0 references
0.87926686
0 references
0.87869644
0 references
0.87314934
0 references
0.86853874
0 references
