1. Intersection and union of regular languages and state complexity;Birget;Inform. Process. Lett.,1992
2. A. Brüggemann-Klein, M. Murata, D. Wood, Regular tree and regular hedge languages over unranked alphabets, HKUST Technical report, 2001.
3. H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, C. Löding, S. Tison, M. Tommasi, Tree automata techniques and applications. Electronic book available at http://tata.gforge.inria.fr, 2007.
4. Deterministic automata on unranked trees;Cristau,2005
5. Estimation of state complexity of combined operations;Ésik;Theoret. Comput. Sci.,2009