Computational completeness of path-structured graph-controlled insertion-deletion systems
From MaRDI portal
Publication:2399250
DOI10.1007/978-3-319-60134-2_8zbMath1410.68185MaRDI QIDQ2399250
Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman
Publication date: 22 August 2017
Full work available at URL: https://doi.org/10.1007/978-3-319-60134-2_8
computational completeness; descriptional complexity measures; graph-controlled ins-del systems; path-structured control graph
68Q42: Grammars and rewriting systems