 |
|
|
|
| HAL: hal-00482396, version 5 |
| Detailed view |  Export this paper |
|
|
| ACL 2010, Uppsala : Sweden (2010) |
|
|
| Available versions: | v1 (2010-05-10) | v2 (2010-05-11) | v3 (2010-07-17) | v4 (2010-08-19) | v5 (2010-08-19) |
|
|
|
|
| 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 |
|
|
|
|
|
|
|
|
|
| Subject | : | Computer Science/Computation and Language Computer Science/Logic in Computer Science |
|
|
| Attached file list to this document: | |||||
|
|||||
|
|
|
| hal-00482396, version 5 | |
| http://hal.archives-ouvertes.fr/hal-00482396 | |
| oai:hal.archives-ouvertes.fr:hal-00482396 | |
| From: Sylvain Schmitz | |
| Submitted on: Thursday, 19 August 2010 15:08:07 | |
| Updated on: Thursday, 19 August 2010 17:02:11 | |
