An operational and denotational approach to non-context-freeness
Theoretical Computer Science - Algebraic methods in language processing
wMSO theories as grammar formalisms
Theoretical Computer Science - Algebraic methods in language processing
The MSO Logic-Automaton Connection in Linguistics
LACL '97 Selected papers from the Second International Conference on Logical Aspects of Computational Linguistics
Lambek Calculus Proofs and Tree Automata
LACL '98 Selected papers from the Third International Conference, on Logical Aspects of Computational Linguistics
On the Distinction between Model-Theoretic and Generative-Enumerative Syntactic Frameworks
LACL '01 Proceedings of the 4th International Conference on Logical Aspects of Computational Linguistics
A model-theoretic framework for theories of syntax
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Conditional XPath, the first order complete XPath dialect
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
What Is Context For? Syntax in a Non-Abstract World
Journal of Logic, Language and Information
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2004
Closure properties of linear context-free tree languages with an application to optimality theory
Theoretical Computer Science - Algebraic methods in language processing
Monadic Second-Order Logic and Transitive Closure Logics over Trees
Electronic Notes in Theoretical Computer Science (ENTCS)
Complete Axiomatizations of MSO, FO(TC1) and FO(LFP1) on Finite Trees
LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
Computational linguistics and generative linguistics: the triumph of hope over experience
ILCL '09 Proceedings of the EACL 2009 Workshop on the Interaction between Linguistics and Computational Linguistics: Virtuous, Vicious or Vacuous?
Some interdefinability results for syntactic constraint classes
MOL'07/09 Proceedings of the 10th and 11th Biennial conference on The mathematics of language
The equivalence of tree adjoining grammars and monadic linear context-free tree grammars
MOL'07/09 Proceedings of the 10th and 11th Biennial conference on The mathematics of language
Without remnant movement, MGs are context-free
MOL'07/09 Proceedings of the 10th and 11th Biennial conference on The mathematics of language
Closure properties of minimalist derivation tree languages
LACL'11 Proceedings of the 6th international conference on Logical aspects of computational linguistics
The Equivalence of Tree Adjoining Grammars and Monadic Linear Context-free Tree Grammars
Journal of Logic, Language and Information
Axiomatizing the logical core of XPath 2.0
ICDT'07 Proceedings of the 11th international conference on Database Theory
First order paths in ordered trees
ICDT'05 Proceedings of the 10th international conference on Database Theory
Movement-generalized minimalist grammars
LACL'12 Proceedings of the 7th international conference on Logical Aspects of Computational Linguistics
Reference-Set constraints as linear tree transductions via controlled optimality systems
FG'10/FG'11 Proceedings of the 15th and 16th international conference on Formal Grammar
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
From the Publisher:Early formal specifications of natural language syntax were quite closely connected to the notion of abstract machines for computing them. More recently, this approach has been superseded by one in which languages are specified in terms of systems of constraints on the structure of their sentences. This book presents a natural and quite general means of expressing constraints on the structure of trees and shows that the languages that can be specified by systems of such constraints are exactly those computable by a particular standard class of abstract machines.