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 this page instead for the normal view: Computational completeness of path-structured graph-controlled insertion-deletion systems |
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Computational completeness of path-structured graph-controlled insertion-deletion systems |
scientific article |
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