Cover Complexity of Finite Languages - Descriptional Complexity of Formal Systems Access content directly
Conference Papers Year : 2018

Cover Complexity of Finite Languages


We consider the notion of cover complexity of finite languages on three different levels of abstraction. For arbitrary cover complexity measures, we give a characterisation of the situations in which they collapse to a bounded complexity measure. Moreover, we show for a restricted class of context-free grammars that its grammatical cover complexity measure w.r.t. a finite language L is unbounded and that the cover complexity of L can be computed from the exact complexities of a finite number of covers $$L' \supseteq L$$. We also investigate upper and lower bounds on the grammatical cover complexity of the language operations intersection, union, and concatenation on finite languages for several different types of context-free grammars.
Fichier principal
Vignette du fichier
470153_1_En_12_Chapter.pdf (343.96 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01905625 , version 1 (26-10-2018)





Stefan Hetzl, Simon Wolfsteiner. Cover Complexity of Finite Languages. 20th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2018, Halifax, NS, Canada. pp.139-150, ⟨10.1007/978-3-319-94631-3_12⟩. ⟨hal-01905625⟩
25 View
63 Download



Gmail Facebook X LinkedIn More