Studies in the logic of trees with applications to grammar formalisms
Studies in the logic of trees with applications to grammar formalisms
On descriptive complexity, language complexity, and GB
Specifying syntactic structures
MOSEL: A FLexible Toolset for Monadic Second-Order Logic
TACAS '97 Proceedings of the Third International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Mona: Monadic Second-Order Logic in Practice
TACAS '95 Proceedings of the First International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Algorithms for Guided Tree Automata
WIA '96 Revised Papers from the First International Workshop on Implementing Automata
An alternative conception of tree-adjoining derivation
Computational Linguistics
Representing constraints with automata
ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics
A model-theoretic framework for theories of syntax
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Book reviews: Tree adjoining grammars: formalisms, linguistic analysis and processing
Computational Linguistics
Some interdefinability results for syntactic constraint classes
MOL'07/09 Proceedings of the 10th and 11th Biennial conference on The mathematics of language
| Hi-index | 0.00 |
Since the early Sixties and Seventies it has been known that the regular and context-free languages are characterized by definability in the monadic second-order theory of certain structures. More recently, these descriptive characterizations have been used to obtain complexity results for constraint- and principle-based theories of syntax and to provide a uniform model-theoretic framework for exploring the relationship between theories expressed in disparate formal terms. These results have been limited, to an extent, by the lack of descriptive characterizations of language classes beyond the context-free. Recently, we have shown that tree-adjoining languages (in a mildly generalized form) can be characterized by recognition by automata operating on three-dimensional tree manifolds, a three-dimensional analog of trees. In this paper, we exploit these automata-theoretic results to obtain a characterization of the tree-adjoining languages by definability in the monadic second-order theory of these three-dimensional tree manifolds. This not only opens the way to extending the tools of model-theoretic syntax to the level of TALs, but provides a highly flexible mechanism for defining TAGs in terms of logical constraints.