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. (Q4923565): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Translations on a context free grammar / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak Second‐Order Arithmetic and Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree acceptors and some of their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision Problems of Finite Automata Design and Related Arithmetics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Macro tree transducers, attribute grammars, and MSO definable tree translations. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular description of context-free graph languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spinal-formed context-free tree grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree adjunct grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Descriptions of cross-serial dependencies / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalized approach to formal languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic automata and context-free sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4547828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4954002 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized finite automata theory with an application to a decision problem of second-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385530 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equivalence of four extensions of context-free grammars / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s1571-0661(05)82584-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2155157347 / rank
 
Normal rank

Latest revision as of 12:18, 30 July 2024

scientific article; zbMATH DE number 6165932
Language Label Description Also known as
English
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.
scientific article; zbMATH DE number 6165932

    Statements

    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. (English)
    0 references
    0 references
    0 references
    24 May 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references