Improved descriptional complexity results on generalized forbidding grammars
From MaRDI portal
Publication:5919636
DOI10.1007/978-3-030-11509-8_15MaRDI QIDQ5919636
Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman, Rufus O. Oladele
Publication date: 10 October 2019
Published in: Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-11509-8_15
computational completeness; semi-conditional grammars; generalized forbidding grammars; descriptional complexity in formal languages
68Wxx: Algorithms in computer science