Descriptional complexity of matrix simple semi-conditional grammars
From MaRDI portal
Publication:2179331
DOI10.1007/978-3-030-23247-4_8zbMath1434.68219OpenAlexW2954513813MaRDI QIDQ2179331
Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman
Publication date: 12 May 2020
Full work available at URL: https://hal.inria.fr/hal-02387307/file/480958_1_En_8_Chapter.pdf
computational completenessmatrix grammarsdescriptional complexitysimple semi-conditional grammarsGeffert normal forms
Related Items (2)
Parsimonious computational completeness ⋮ On the computational completeness of matrix simple semi-conditional grammars
This page was built for publication: Descriptional complexity of matrix simple semi-conditional grammars