Spinal-formed context-free tree grammars

Theory of Computing Systems

Volumn 33, Issue 1, 2000, Pages 59-83

  Fujiyoshi, A ^a   Kasai, T ^a  

^a UNIVERSITY OF ELECTRO COMMUNICATIONS   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTATIONAL GRAMMARS; CONTEXT FREE GRAMMARS; CONTEXT SENSITIVE GRAMMARS; FORESTRY;

CONTEXT-FREE TREE GRAMMARS; FORMAL PROPERTIES; NATURAL LANGUAGES; RECENT RESEARCHES; RESTRICTED MODELS; STRING LANGUAGES; TREE ADJOINING GRAMMARS; TREE LANGUAGES;

CONTEXT FREE LANGUAGES;

EID: 0034380721     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s002249910004     Document Type: Article

References (19)

1. W. S. Brainerd, Tree generating regular systems. Information and Control, vol. 14, no. 2, pp. 217-231, 1969.
2. J. Engelfriet, Bottom-up and top-down tree transformations - a comparison. Mathematical Systems Theory, vol. 9, no. 3, pp. 198-231, 1975.
3. J. Engelfriet and E. M. Schmidt, IO and OI, Journal of Computer and System Sciences, vol. 15, no. 3, pp. 328-353, 1977, and vol. 16, no. 1, pp. 67-99, 1978.
4. J. Engelfriet and E. M. Schmidt, IO and OI, Journal of Computer and System Sciences, vol. 15, no. 3, pp. 328-353, 1977, and vol. 16, no. 1, pp. 67-99, 1978.
5. M. J. Fischer, Grammars with macro-like productions, Ph.D. thesis, Harvard University, Cambridge, MA, 1968.
6. M. J. Fischer, Grammars with macro-like productions, Proc. 9th IEEE Symp. on Switching and Automata Theory, pp. 131-142, 1968.
7. F. Gécseg and M. Steinby, Tree Automata, Akadémiai Kiadó, Budapest, 1984.
8. I. Guessarian, Pushdown tree automata. Mathematical Systems Theory, vol. 16, no. 4, pp. 237-263, 1983.
9. J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages and Computation, Addison-Wesley, Reading, MA, 1979.
10. A. K. Joshi, L. S. Levy, and M. Takahashi, Tree adjunct grammars, Journal of Computer and System Sciences, vol. 10, no. 1, pp. 136-163, 1975.
11. 6) time, SIAM Journal on Computing, vol. 25, no. 4, pp. 862-873, 1996.
12. 2)) time, Journal of Computer and System Sciences, vol. 56, no. 1, pp. 83-89, 1998.
13. J. Rogers, Capturing CFLs with tree adjoining grammars, Proc. 32nd Meeting of the Association for Computational Linguistics, 1994.
14. W. C. Rounds, Mapping and grammars on trees, Mathematical Systems Theory, vol. 4, no. 3, pp. 257-287, 1970.
15. S. Tanaka and T. Kasai, The emptiness problem for indexed languages is exponential time complete, The IEICE Transactions (published in Japanese), vol. J68-D, no. 10, pp. 1727-1734, 1985.
16. J. W. Thatcher, Tree automata: an informal survey, in Currents in the Theory of Computing, ed. A. V. Aho, pp. 143-172, Prentice-Hall, Englewood Cliffs, NJ, 1973.
17. K. Vijay-Shanker, A study of tree adjoining grammars, Ph.D. thesis, University of Pennsylvania, Philadelphia, PA, 1987.
18. K. Vijay-Shanker and A. K. Joshi, Some computational properties of tree adjoining grammars, Proc. 23rd Meeting of the Association for Computational Linguistics, pp. 82-93, 1985.
19. K. Vijay-Shanker and D. J. Weir, The equivalence of four extensions of context-free grammars, Mathematical Systems Theory, vol. 27, no. 6, pp. 511-546, 1994.