 |
|
|
|
| HAL : hal-00482396, version 5 |
| Fiche détaillée |  Récupérer au format |
|
|
| ACL 2010, Uppsala : Sweden (2010) |
|
|
| Versions disponibles : | v1 (10-05-2010) | v2 (11-05-2010) | v3 (17-07-2010) | v4 (19-08-2010) | v5 (19-08-2010) |
|
|
|
|
| On the Computational Complexity of Dominance Links in Grammatical Formalisms |
|
|
| Sylvain Schmitz 1 |
|
|
| (2010) |
|
|
|
| Dominance links were introduced in grammars to model long distance scrambling phenomena, motivating the definition of multiset-valued linear indexed grammars (MLIGs) by Rambow (ACL 1994), and inspiring quite a few recent formalisms. It turns out that MLIGs have since been rediscovered and reused in a variety of contexts, and that the complexity of their emptiness problem has become the key to several open questions in computer science. We survey complexity results and open issues on MLIGs and related formalisms, and provide new complexity bounds for some linguistically motivated restrictions. |
|
|
|
|
|
|
|
|
|
|
|
| 1 : | Laboratoire Spécification et Vérification [Cachan] (LSV) |
|
|
|
CNRS : UMR8643 – INRIA – École normale supérieure de Cachan - ENS Cachan |
|
|
|
|
|
|
|
|
|
| Domaine | : | Informatique/Informatique et langage Informatique/Logique en informatique |
|
|
| Liste des fichiers attachés à ce document : | |||||
|
|||||
|
|
|
| hal-00482396, version 5 | |
| http://hal.archives-ouvertes.fr/hal-00482396 | |
| oai:hal.archives-ouvertes.fr:hal-00482396 | |
| Contributeur : Sylvain Schmitz | |
| Soumis le : Jeudi 19 Août 2010, 15:08:07 | |
| Dernière modification le : Jeudi 19 Août 2010, 17:02:11 | |
