Descriptional complexity of matrix simple semi-conditional grammars
From MaRDI portal
Publication:2179331
DOI10.1007/978-3-030-23247-4_8zbMath1434.68219MaRDI 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 completeness; matrix grammars; descriptional complexity; simple semi-conditional grammars; Geffert normal forms
68Q42: Grammars and rewriting systems