Author:
Engelfriet Joost,Maletti Andreas
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Lecture Notes in Computer Science;J Engelfriet,2000
2. Engelfriet, J., Schmidt, E.M.: IO and OI I. J. Comput. Syst. Sci. 15(3), 328–353 (1977)
3. Fujiyoshi, A.: Epsilon-free grammars and lexicalized grammars that generate the class of the mildly context-sensitive languages. In: Proceedings of the 7th International Workshop on Tree Adjoining Grammar and Related Formalisms, pp. 16–23 (2005)
4. Gécseg, F., Steinby, M.: Tree languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 3, chap. 1, pp. 1–68. Springer, Heidelberg (1997). doi: 10.1007/978-3-642-59126-6_1
5. Joshi, A.K., Levy, L.S., Takahashi, M.: Tree adjunct grammars. J. Comput. Syst. Sci. 10(1), 136–163 (1975)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Beyond the elementary representations of program invariants over algebraic data types;Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation;2021-06-18
2. Multiple context-free tree grammars: Lexicalization and characterization;Theoretical Computer Science;2018-06