Minimalist tree languages are closed under intersection with recognizable tree languages

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6736 LNAI, Issue , 2011, Pages 129-144

  Kobele, Gregory M ^a  

^a UNIVERSITY OF CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONTEXT-SENSITIVE; GENERATIVE CAPACITY; PROOF METHODS; REGULAR TREE LANGUAGES; TREE LANGUAGES; RECOGNIZABLE TREE LANGUAGES;

COMPUTATIONAL LINGUISTICS; CONTEXT SENSITIVE GRAMMARS; PLANT EXTRACTS; SEMANTICS; COMPUTATIONAL GRAMMARS; LINGUISTICS;

CONTEXT SENSITIVE LANGUAGES; FORESTRY;

EID: 79960136353     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-22221-4_9     Document Type: Conference Paper

References (21)

1. Stabler, E.P.: Derivational minimalism. In: Retoré, C. (ed.) LACL 1996. LNCS (LNAI), vol. 1328, pp. 68-95. Springer, Heidelberg (1997)
2. Thatcher, J.W.: Characterizing derivation trees of context-free grammars through a generalization of finite automata theory. Journal of Computer and System Sciences 1(4), 317-322 (1967)
3. Koopman, H.: On restricting recursion and the form of syntactic representations. In: Speas, P., Roeper, T. (eds.) Recursion. Oxford University Press, Oxford (to appear)
4. Heim, I., Kratzer, A.: Semantics in Generative Grammar. Blackwell Publishers, Malden (1998)
5. Kobele, G.M., Retoré, C., Salvati, S.: An automata theoretic approach to minimalism. In: Rogers, J., Kepser, S. (eds. Proceedings of the Workshop Model-Theoretic Syntax at 10, ESSLLI 2007, Dublin (2007)
6. Michaelis, J.: On Formal Properties of Minimalist Grammars. PhD thesis, Universität Potsdam (2001)
7. Raoult, J.C.: Rational tree relations. Bulletin of the Belgian Mathematical Society 4, 149-176 (1997)
8. Courcelle, B.: Monadic second-order definable graph transductions: a survey. Theoretical Computer Science 126, 53-75 (1994)
9. Kobele, G.M.: Formalizing mirror theory. Grammars 5(3), 177-221 (2002)
10. Engelfriet, J.: Context-free graph grammars. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages. Beyond Words, vol. 3, pp. 125-213. Springer, Heidelberg (1997)
11. Lang, B.: Recognition can be harder than parsing. Computational Intelligence 10(4), 486-494 (1994)
12. Graf, T.: A tree transducer model of reference-set computation. UCLA Working Papers in Linguistics 15, 1-53 (2010)
13. Chomsky, N.: Aspects of the Theory of Syntax. MIT Press, Cambridge (1965)
14. Kobele, G.M.: Generating Copies: An investigation into structural identity in language and grammar. PhD thesis, University of California, Los Angeles (2006)
15. Koopman, H., Szabolcsi, A.: Verbal Complexes. MIT Press, Cambridge (2000)
16. Kayne, R.: The Antisymmetry of Syntax. MIT Press, Cambridge (1994)
17. Koopman, H.: Derivations and complexity filters. In: Alexiadou, A., Anagnostopoulou, E., Barbiers, S., Gärtner, H.M. (eds.) Dimensions of Movement: From features to remnants. Linguistik Aktuell/Linguistics Today, vol. 48, pp. 151-188. John Benjamins, Amsterdam (2002)
18. Halle, M., Marantz, A.: Distributed morphology and the pieces of inflection. In: Hale, K., Keyser, S.J. (eds.) The View from Building 20, pp. 111-176. MIT Press, Cambridge (1993)
19. Mönnich, U.: Minimalist syntax, multiple regular tree grammars and direction preserving tree transductions. In: Rogers, J., Kepser, S. (eds.) Proceedings of the Workshop Model-Theoretic Syntax at 10, ESSLLI 2007, Dublin (2007)
20. Engelfriet, J., Heyker, L.: The string generating power of context-free hypergraph grammars. Journal of Computer and System Sciences 43, 328-360 (1991) (Pubitemid 21708753)
21. Morawietz, F., Cornell, T.: The MSO logic-automaton connection in linguistics. In: Lecomte, A., Lamarche, F., Perrier, G. (eds.) LACL 1997. LNCS (LNAI), vol. 1582, pp. 112-131. Springer, Heidelberg (1999)