Commutative grammars: the complexity of uniform word problems
Information and Control
A structure to decide reachability in Petri nets
Theoretical Computer Science
Using descriptions of trees in a tree adjoining grammar
Computational Linguistics
Formal and computational aspects of natural language syntax
Formal and computational aspects of natural language syntax
A polynomial &lgr;-bisimilar normalization for reset Petri nets
Theoretical Computer Science
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Information and Computation - Special issue on EXPRESS 1997
Petri Net Theory and the Modeling of Systems
Petri Net Theory and the Modeling of Systems
LACL '96 Selected papers from the First International Conference on Logical Aspects of Computational Linguistics
Petri Nets, Commutative Context-Free Grammars, and Basic Parallel Processes
FCT '95 Proceedings of the 10th International Symposium on Fundamentals of Computation Theory
Decidability of reachability in vector addition systems (Preliminary Version)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
An algorithm for the general Petri net reachability problem
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Exponential space complete problems for Petri nets and commutative semigroups (Preliminary Report)
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Computational Linguistics
Long-distance scrambling and tree adjoining grammars
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
The computational difficulty of ID/LP parsing
ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
D-theory: talking about talking about trees
ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
Multiset-valued linear index grammars: imposing dominance constraints on derivations
ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
An efficient graph algorithm for dominance constraints
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Language and Automata Theory and Applications
Two-variable logic on data trees and XML reasoning
Journal of the ACM (JACM)
Journal of Computer and System Sciences
Journal of Computer and System Sciences
Research on Language and Computation
The complexity and generative capacity of lexicalized abstract categorial grammars
LACL'05 Proceedings of the 5th international conference on Logical Aspects of Computational Linguistics
The covering and boundedness problems for branching vector addition systems
Journal of Computer and System Sciences
| Hi-index | 0.00 |
Dominance links were introduced in grammars to model long distance scrambling phenomena, motivating the definition of multiset-valued linear indexed grammars (MLIGs) by Rambow (1994b), 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.