1. Brüggemann-Klein, A., Murata, M., Wood, D.: Regular tree and regular hedge languages over unranked alphabets: version 1. Techcial report HKUST-TCSC-2001-0, The Hong Kong University of Science and Technology (2001).
http://repository.ust.hk/ir/Record/1783.1-738
2. Lecture Notes in Computer Science;J Carme,2004
3. Comon, H., et al.: Tree automata techniques and applications.
http://www.grappa.univ-lille3.fr/tata
. Accessed 12 Oct 2007
4. Droste, M., Vogler, H.: Weighted logics for unranked tree automata. Theory Comput. Syst. 48(1), 23–47 (2011).
https://doi.org/10.1007/s00224-009-9224-4
5. Gécseg, F., Steinby, M.: Tree Automata. Akadémiai Kiadó, Budapest (1984).
https://arxiv.org/abs/1509.06233