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
From MaRDI portal
Publication:4923565
DOI10.1016/S1571-0661(05)82584-8zbMath1263.68090MaRDI QIDQ4923565
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
03B65: Logic of natural languages
03D05: Automata and formal grammars in connection with logical questions
68Q42: Grammars and rewriting systems
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Regular description of context-free graph languages
- Tree adjunct grammars
- A generalized approach to formal languages
- Macro tree transducers, attribute grammars, and MSO definable tree translations.
- Spinal-formed context-free tree grammars
- Tree acceptors and some of their applications
- Weak Second‐Order Arithmetic and Finite Automata
- Decision Problems of Finite Automata Design and Related Arithmetics
- The equivalence of four extensions of context-free grammars
- Algebraic automata and context-free sets
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Translations on a context free grammar
- Descriptions of cross-serial dependencies