A model theoretic description of tree adjoining grammars

DOI10.1016/S1571-0661(05)82584-8MaRDI QIDQ4923565zbMATH OpenOpenAlexFDO

Authors Frank Morawietz, Uwe Mönnich

Publication date 24 May 2013

Published in Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s1571-0661(05)82584-8

Mathematics Subject Classification ID

Logic of natural languages (03B65) Automata and formal grammars in connection with logical questions (03D05) Grammars and rewriting systems (68Q42)

Recommendations

• The equivalence of tree adjoining grammars and monadic linear context-free tree grammars
• The equivalence of tree adjoining grammars and monadic linear context-free tree grammars
• Monadic Second-Order Logic and Transitive Closure Logics over Trees
• scientific article; zbMATH DE number 1941335
• scientific article; zbMATH DE number 475427

Cites work

• A generalized approach to formal languages
• Algebraic automata and context-free sets
• Decision Problems of Finite Automata Design and Related Arithmetics
• Descriptions of cross-serial dependencies
• Generalized finite automata theory with an application to a decision problem of second-order logic
• scientific article; zbMATH DE number 1142314 (Why is no real title available?)
• scientific article; zbMATH DE number 1142315 (Why is no real title available?)
• scientific article; zbMATH DE number 1786532 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• scientific article; zbMATH DE number 1447282 (Why is no real title available?)
• Macro tree transducers, attribute grammars, and MSO definable tree translations.
• Regular description of context-free graph languages
• Spinal-formed context-free tree grammars
• The equivalence of four extensions of context-free grammars
• Translations on a context free grammar
• Tree acceptors and some of their applications
• Tree adjunct grammars
• Weak Second‐Order Arithmetic and Finite Automata

Cited in

(10)

• 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
• On the degree of nondeterminism of tree adjoining languages and head grammar languages
• On the relation between multi-depth grammars and tree adjoining grammars
• Two Equivalent Regularizations for Tree Adjoining Grammars
• The equivalence of tree adjoining grammars and monadic linear context-free tree grammars
• scientific article; zbMATH DE number 1941335 (Why is no real title available?)
• Descriptions of cross-serial dependencies
• Talking about trees and truth-conditions

This page was built for publication: A model theoretic description of tree adjoining grammars

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4923565)