On the computational completeness of graph-controlled insertion–deletion systems with binary sizes (Q59864878)
Jump to navigation
Jump to search
No description defined
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the computational completeness of graph-controlled insertion–deletion systems with binary sizes |
No description defined |
Statements
On the computational completeness of graph-controlled insertion–deletion systems with binary sizes (English)
0 references
June 2017
0 references
682
0 references
100-121
0 references