Publisher
Springer Berlin Heidelberg
Reference24 articles.
1. Berstel, J.: Transductions and context-free languages, vol. 4. Teubner Stuttgart (1979)
2. Chomsky, N., Schützenberger, M.P.: The algebraic theory of context-free languages. computer programming and formal languages, pp. 118–161. North-Holland (1963)
3. Fischer, M.J.: Grammars with macro-like productions. In: IEEE Conference Record of 9th Annual Symposium on Switching and Automata Theory, 1968, pp. 131–142. IEEE (1968)
4. Joshi, A.K.: Tree adjoining grammars: How much context-sensitivity is required to provide reasonable structural descriptions? University of Pennsylvania, Moore School of Electrical Engineering, Department of Computer and Information Science (1985)
5. Joshi, A.K., Schabes, Y.: Tree-adjoining grammars. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, pp. 69–123. Springer (1997)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Homomorphic Characterizations of Indexed Languages;Language and Automata Theory and Applications;2016