Descriptional Complexity of Graph-Controlled Insertion-Deletion Systems
From MaRDI portal
Publication:2829975
DOI10.1007/978-3-319-41114-9_9zbMath1410.68184MaRDI QIDQ2829975
Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman
Publication date: 9 November 2016
Published in: Descriptional Complexity of Formal Systems (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01633956/file/416473_1_En_9_Chapter.pdf
computational completeness; insertion-deletion systems; descriptional complexity measures; graph-controlled systems