Abstract Families of Abstract Categorial Languages

Electronic Notes in Theoretical Computer Science

Volumn 165, Issue SPEC. ISS., 2006, Pages 65-80

  Kanazawa, Makoto ^a  

^a NATIONAL INSTITUTE OF INFORMATICS   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; COMPUTATIONAL GRAMMARS; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SCIENCE; TREES (MATHEMATICS);

ABSTRACT CATEGORIAL LANGUAGES; ABSTRACT FAMILIES; STRING LANGUAGES; TREE LANGUAGES;

FORMAL LANGUAGES;

EID: 33750713349     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2006.05.037     Document Type: Article

References (19)

1. Aho A.V. Indexed grammars-An extension of context-free grammars. Journal of the Association for Computing Machinery 15 (1968) 647-671
2. Arnold A., and Dauchet M. Forêts algébriques et homomorphismes inverses. Information and Control 37 (1978) 182-196
3. Comon H., Dauchet M., Gilleron R., Jacquemard F., Lugiez D., Tison S., and Tommasi M. Tree Automata Techniques and Applications. Available online at (2002). http://www.grappa.univ-lille3.fr/tata/
4. Gazdar G. Applicability of indexed grammars to natural languages. In: Reyle U., and Rohrer C. (Eds). Natural Language Parsing and Linguistic Theories (1988), Reidel, Dordrecht 69-94
5. Gécseg F., and Steinby M. Tree languages. In: Rozenberg G., and Salomaa A. (Eds). Handbook of Formal Languages, Vol. 3: Beyond Words (1997), Springer, Berlin 1-68
6. Ginsburg S., and Greibach S. Abstract families of languages. Studies in Abstract Families of Languages. Memoir No. 87 (1969), American Mathematical Society, Providence, R.I. 1-32
7. Greibach S., and Hopcroft J. Independence of AFL operators. Studies in Abstract Families of Languages. Memoir No. 87 (1969), American Mathematical Society, Providence, R.I. 33-40
8. de Groote, Philippe. Towards abstract categorial grammars. In Association for Computational Linguistics, 39th Annual Meeting and 10th Conference of the European Chapter, Proceedings of the Conference, pages 148-155, 2001
9. de Groote, Philippe. Tree-adjoining grammars as abstract categorial grammars. In Proceedings of the Sixth International Workshop on Tree Adjoining Grammar and Related Frameworks (TAG+6), pages 101-106. Universitá di Venezial, 2002
10. de Groote, Philippe, Bruno Guillaume, and Sylvain Salvati. Vector addition tree automata. In Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, pages 64-73, 2004
11. de Groote P., and Pogodalla S. On the expressive power of abstract categorial grammars: Representing context-free formalisms. Journal of Logic, Language and Information 13 (2004) 421-438
12. Hindley J.R. BCK-combinators and linear λ-terms have types. Theoretical Computer Science 64 (1989) 97-105
13. Hindley J.R. Basic Simple Type Theory (1997), Cambridge University Press, Cambridge
14. Joshi A.K., and Schabes Y. Tree-adjoining grammars. In: Rozenberg G., and Salomaa A. (Eds). Handbook of Formal Languages, Vol. 3: Beyond Words (1997), Springer, Berlin 69-123
15. Kanazawa, Makoto and Ryo Yoshinaka. Lexicalization of second-order ACGs. NII Technical Report. NII-2005-012E. National Institute of Informatics, Tokyo, 2005
16. Salvati, Sylvain. Problèmes de Filtrage et Problèmes d'analyse pour les Grammaires Catégorielles Abstraites. Doctoral thesis. Institut National Polytechnique de Lorraine, 2005
17. Seki H., Matsumura T., Fujii M., and Kasami T. On multiple context-free grammars. Theoretical Computer Science 88 (1991) 191-229
18. Weir, David J. Characterizing Mildly Context-Sensitive Grammar Formalisms. Ph.D. dissertation. University of Pennsylvania, 1988
19. Yoshinaka R., and Kanazawa M. The complexity and generative capacity of lexicalized abstract categorial grammars. In: Blache P., Stabler E., Busquets J., and Moot R. (Eds). Logical Aspects of Computational Linguistics: 5th International Conference. LACL 2005 (2005), Springer, Berlin 330-346