New nonterminal complexity results for semi-conditional grammars
From MaRDI portal
Publication:1670738
DOI10.1007/978-3-319-94418-0_18OpenAlexW2810182789MaRDI QIDQ1670738
Rufus O. Oladele, Henning Fernau, Lakshmanan Kuppusamy
Publication date: 6 September 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-94418-0_18
Related Items (4)
Parsimonious computational completeness ⋮ Improved Descriptional Complexity Results for Simple Semi-Conditional Grammars ⋮ Improved descriptional complexity results on generalized forbidding grammars ⋮ On the computational completeness of matrix simple semi-conditional grammars
This page was built for publication: New nonterminal complexity results for semi-conditional grammars
