BLLDB - Title Entry - Kepser, Stephan: The equivalence of tree adjoining grammars and monadic linear context-free tree grammars

Guest (Restricted Access)

Selected titles: 0

Export:
Text | Dublin Core | RIS

Journal article

Bibliographic description

Author		Kepser, Stephan; Rogers, Jim
Title		The equivalence of tree adjoining grammars and monadic linear context-free tree grammars

Written in		English
Source		Journal of logic, language and information. - Dordrecht [u.a.] : Kluwer
Volume		20
Year		2011
Issue		3
Page		361-384

Classification
Domains / Computational linguistics / Parsing / Grammar types (computational linguistics)

Domains / Grammaticography / Models of grammar / Tree adjoining grammar

Domains / Mathematical linguistics

Domains / Linguistic logic / Predicate logic


Redirected from
Formale Grammatiken; Chomsky-Hierarchie; Unrestricted rewriting system; Context-sensitive grammar; Context-free grammar; Finite state grammar; Polychrome tree grammar; Tectogrammatical tree structure; TGTS; Grammar types (computational linguistics) ; Tree substitution grammar ; Quantitative Linguistik; Mathematical linguistics ; First-order logic; Second-order logic; Monadische Logik; Monadic logic; Dependence logic; Predicate logic