On describing the regular closure of the linear languages with graph-controlled insertion-deletion systems
From MaRDI portal
Publication:4553829
DOI10.1051/ita/2018005zbMath1400.68102WikidataQ59864872 ScholiaQ59864872MaRDI QIDQ4553829
Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman
Publication date: 1 November 2018
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1051/ita/2018005
insertion-deletion systems; descriptional complexity measures; regular closure of linear languages; graph-controlled systems