Descriptional complexity of graph-controlled insertion-deletion systems (Q2829975)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Descriptional complexity of graph-controlled insertion-deletion systems |
scientific article; zbMATH DE number 6649508
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Descriptional complexity of graph-controlled insertion-deletion systems |
scientific article; zbMATH DE number 6649508 |
Statements
Descriptional Complexity of Graph-Controlled Insertion-Deletion Systems (English)
0 references
9 November 2016
0 references
insertion-deletion systems
0 references
graph-controlled systems
0 references
descriptional complexity measures
0 references
computational completeness
0 references
0.9006716012954712
0 references
0.8908142447471619
0 references
0.8882879018783569
0 references
0.8799538612365723
0 references
0.8744232058525085
0 references
