On the Grammatical Complexity of Finite Languages - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2018

On the Grammatical Complexity of Finite Languages

Résumé

We study the grammatical production complexity of finite languages w.r.t. (i) different interpretations of approximation, i.e., equivalence, cover, and scattered cover, and (ii) whether the underlying grammar generates a finite or infinite language. In case the generated language is infinite, the intersection with all words up to a certain length has to be considered in order to obtain the finite language under consideration. In this way, we obtain six different measures for regular, linear context-free, and context-free grammars. We compare these measures according to the taxonomy introduced in [J. Dassow, Gh. Păun: Regulated Rewriting in Formal Language Theory, 1989] with each other by fixing the grammar type and varying the complexity measure and the other way around, that is, by fixing the complexity measure and varying the grammar type. In both of these cases, we develop an almost complete picture, which gives new and interesting insights into the old topic of grammatical production complexity.
Fichier principal
Vignette du fichier
470153_1_En_13_Chapter.pdf (321.99 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

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

Licence

Paternité

Identifiants

Citer

Markus Holzer, Simon Wolfsteiner. On the Grammatical Complexity of Finite Languages. 20th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2018, Halifax, NS, Canada. pp.151-162, ⟨10.1007/978-3-319-94631-3_13⟩. ⟨hal-01905630⟩
218 Consultations
87 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More