Computational completeness of path-structured graph-controlled insertion-deletion systems (Q2399250)
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 6763316
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational completeness of path-structured graph-controlled insertion-deletion systems |
scientific article; zbMATH DE number 6763316 |
Statements
Computational completeness of path-structured graph-controlled insertion-deletion systems (English)
0 references
22 August 2017
0 references
graph-controlled ins-del systems
0 references
path-structured control graph
0 references
computational completeness
0 references
descriptional complexity measures
0 references
0 references
0.9370306134223938
0 references
0.9314315915107728
0 references
0.8846520185470581
0 references
0.8799538612365723
0 references
0.8767998218536377
0 references
