On the Degree of Nondeterminism of Tree Adjoining Languages and Head Grammar 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 : 2017

On the Degree of Nondeterminism of Tree Adjoining Languages and Head Grammar Languages

Suna Bensch
  • Fonction : Auteur
  • PersonId : 1011785
Maia Hoeberechts
  • Fonction : Auteur
  • PersonId : 1024599

Résumé

The degree of nondeterminism is a measure of syntactic complexity which was investigated for parallel and sequential rewriting systems. In this paper, we consider the degree of nondeterminsm for tree adjoining grammars and their languages and head grammars and their languages. We show that a degree of nondeterminism of 2 suffices for both formalisms in order to generate all languages in their respective language families. Furthermore, we show that deterministic tree adjoining grammars (those with degree of nondeterminism equal to 1), can generate non-context-free languages, in contrast to deterministic head grammars which can only generate languages containing a single word.
Fichier principal
Vignette du fichier
440206_1_En_5_Chapter.pdf (311.54 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01657017 , version 1 (06-12-2017)

Licence

Paternité

Identifiants

Citer

Suna Bensch, Maia Hoeberechts. On the Degree of Nondeterminism of Tree Adjoining Languages and Head Grammar Languages. 19th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2017, Milano, Italy. pp.65-76, ⟨10.1007/978-3-319-60252-3_5⟩. ⟨hal-01657017⟩
29 Consultations
76 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More