1. Corazza, A., Satta, G.: Probabilistic context-free grammars estimated from infinite distributions. IEEE Trans. Pattern anal. Mach. Intell. 29(8), 1379–1393 (2007)
2. Fischer, M.: Grammars with macro-like productions. Ph.D. thesis. Harvard University, Massachusetts (1968)
3. Gebhardt, K., Osterholzer, J.: A direct link between tree-adjoining and context-free tree grammars. In: Proceedings of the 12th International Conference on Finite-State Methods and Natural Language Processing (2015)
4. Gécseg, F., Steinby, M.: Tree automata. In: Kiadó, A. (ed.). Reissued 2015. Akadémiai Kiadó, Budapest (1984). arXiv:1509.06233 [cs.FL]
5. Joshi, A., Schabes, Y.: Tree-adjoining grammars. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 3, pp. 69–123. Springer, Heidelberg (1997)