Improved descriptional complexity results on generalized forbidding grammars
From MaRDI portal
Publication:5918761
DOI10.1016/j.dam.2020.12.027MaRDI QIDQ5918761
Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman, Rufus O. Oladele
Publication date: 4 August 2022
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2020.12.027
computational completeness; semi-conditional grammars; generalized forbidding grammars; descriptional complexity in formal languages
68Q42: Grammars and rewriting systems