scientific article; zbMATH DE number 1447282
From MaRDI portal
Publication:4954002
zbMath0956.03030MaRDI QIDQ4954002
No author found.
Publication date: 16 May 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
satisfactionmodellabeled treefree-indexationgovernment and binding theorylanguage-theoretic complexitystrongly context-free language
Formal languages and automata (68Q45) Logic of natural languages (03B65) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Natural language processing (68T50)
Related Items (12)
A Model-Theoretic Description of Tree Adjoining Grammars1 1The research presented in this paper was supported by the Deutsche Forschungsgemeinschaft within the Sonderforschungsbereich 441, TP A2. The authors wish to thank Jens Michaelis and Stephan Kepser for helpful comments. ⋮ Closure properties of linear context-free tree languages with an application to optimality theory ⋮ Relativized adjacency ⋮ The equivalence of tree adjoining grammars and monadic linear context-free tree grammars ⋮ Monadic Second-Order Logic and Transitive Closure Logics over Trees ⋮ Model Theoretic Syntax and Parsing ⋮ What is context for? Syntax in a non-abstract world ⋮ Complete Axiomatizations of MSO, FO(TC 1 ) and FO(LFP 1 ) on Finite Trees ⋮ Inessential features, ineliminable features, and modal logics for model theoretic syntax ⋮ PDL for ordered trees ⋮ An operational and denotational approach to non-context-freeness ⋮ wMSO theories as grammar formalisms
This page was built for publication:
