On the computational completeness of graph-controlled insertion-deletion systems with binary sizes
From MaRDI portal
Publication:2358685
DOI10.1016/j.tcs.2017.01.019zbMath1371.68085WikidataQ59864878 ScholiaQ59864878MaRDI QIDQ2358685
Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman
Publication date: 15 June 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2017.01.019
P systems; computational completeness; insertion-deletion systems; descriptional complexity measures; graph-controlled systems
DB lookup for MSC labels failed