Closure properties of minimalist derivation 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 96-111

  Graf, Thomas ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Closure Properties; Derivation Tree Languages; Derivational Constraints; Minimalist Grammars; Regular Tree Languages

Indexed keywords

CLOSURE PROPERTY; DERIVATIONAL CONSTRAINTS; MINIMALIST GRAMMARS; REGULAR TREE LANGUAGES; TREE LANGUAGES;

COMPUTATIONAL LINGUISTICS; LINGUISTICS;

PLANT EXTRACTS; FORESTRY;

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

References (17)

1. Chomsky, N.: The Minimalist Program. MIT Press, Cambridge (1995)
2. Chomsky, N.: Derivation by phase. In: Kenstowicz, M.J. (ed.) Ken Hale: A Life in Language, pp. 1-52. MIT Press, Cambridge (2001)
3. Gärtner, H.M., Michaelis, J.: Some remarks on locality conditions and minimalist grammars. In: Sauerland, U., Gärtner, H.M. (eds.) Interfaces + Recursion = Language? Chomsky's Minimalism and the View from Syntax-Semantics, pp. 161-196. Mouton de Gruyter, Berlin (2007)
4. Graf, T.: Reference-set constraints as linear tree transductions via controlled optimality systems. In: Proceedings of the 15th Conference on Formal Grammar (2010) (to appear)
5. Graf, T.: A tree transducer model of reference-set computation. UCLA Working Papers in Linguistics 15, article 4 (2010)
6. Harkema, H.: A characterization of minimalist languages. In: de Groote, P., Morrill, G., Retoré, C. (eds.) LACL 2001. LNCS (LNAI), vol. 2099, pp. 193-211. Springer, Heidelberg (2001) (Pubitemid 33298892)
7. Joshi, A.: Tree-adjoining grammars: How much context sensitivity is required to provide reasonable structural descriptions? In: Dowty, D., Karttunen, L., Zwicky, A. (eds.) Natural Language Parsing, pp. 206-250. Cambridge University Press, Cambridge (1985)
8. Kobele, G.M.: Features moving madly: A formal perspective on feature percolation in the minimalist program. Research on Language and Computation 3(4), 391-410 (2005)
9. Kobele, G.M.: Generating Copies: An Investigation into Structural Identity in Language and Grammar. Ph.D. thesis, UCLA (2006)
10. Kobele, G.M., Retoré, C., Salvati, S.: An Automata-Theoretic Approach to Minimalism. In: Rogers, J., Kepser, S. (eds.) Model Theoretic Syntax at 10, pp. 71-80 (2007)
11. Michaelis, J.: Derivational minimalism is mildly context-sensitive. In: Moortgat, M. (ed.) LACL 1998. LNCS (LNAI), vol. 2014, pp. 179-198. Springer, Heidelberg (2001) (Pubitemid 33298998)
12. Michaelis, J.: Transforming linear context-free rewriting systems into minimalist grammars. In: de Groote, P., Morrill, G., Retoré, C. (eds.) LACL 2001. LNCS (LNAI), vol. 2099, pp. 228-244. Springer, Heidelberg (2001) (Pubitemid 33298894)
13. Rogers, J.: A Descriptive Approach to Language-Theoretic Complexity. CSLI, Stanford (1998)
14. Stabler, E.P.: Derivational minimalism. In: Retoré, C. (ed.) LACL 1996. LNCS (LNAI), vol. 1328, pp. 68-95. Springer, Heidelberg (1997)
15. Stabler, E.P.: Computational perspectives on minimalism. In: Boeckx, C. (ed.) Oxford Handbook of Linguistic Minimalism, pp. 617-643. Oxford University Press, Oxford (2011)
16. Stabler, E.P., Keenan, E.: Structural similarity. Theoretical Computer Science 293, 345-363 (2003)
17. Thatcher, J.W.: Characterizing derivation trees for context-free grammars through a generalization of finite automata theory. Journal of Computer and System Sciences 1, 317-322 (1967)