scientific article; zbMATH DE number 1447282
From MaRDI portal
Publication:4954002
free-indexationgovernment and binding theorylabeled treelanguage-theoretic complexitymodelsatisfactionstrongly context-free language
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Logic of natural languages (03B65) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Formal languages and automata (68Q45) Natural language processing (68T50)
Recommendations
Cited in
(16)- Inessential features, ineliminable features, and modal logics for model theoretic syntax
- Syntactic structures as multi-dimensional trees
- What is context for? Syntax in a non-abstract world
- An operational and denotational approach to non-context-freeness
- wMSO theories as grammar formalisms
- Closure properties of linear context-free tree languages with an application to optimality theory
- Complete Axiomatizations of MSO, FO(TC 1 ) and FO(LFP 1 ) on Finite Trees
- PDL for ordered trees
- scientific article; zbMATH DE number 140381 (Why is no real title available?)
- The equivalence of tree adjoining grammars and monadic linear context-free tree grammars
- scientific article; zbMATH DE number 1869614 (Why is no real title available?)
- Monadic Second-Order Logic and Transitive Closure Logics over Trees
- A model theoretic description of tree adjoining grammars
- Model Theoretic Syntax and Parsing
- Descriptions of cross-serial dependencies
- Relativized adjacency
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4954002)