On the grammatical complexity of finite languages

DOI10.1007/978-3-319-94631-3_13zbMath1435.68167OpenAlexW2879152049MaRDI QIDQ777998

Simon Wolfsteiner, Markus Holzer

Publication date: 30 June 2020

Full work available at URL: https://hal.inria.fr/hal-01905630/file/470153_1_En_13_Chapter.pdf

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items

On the complexity of the smallest grammar problem over fixed alphabets, On the cover complexity of finite languages