1. Theory of Codes;Berstel,1985
2. Tree walking automata cannot be determinized;Bojańczyk;Theoret. Comput. Sci.,2006
3. Tree-walking automata do not recognize all regular languages;Bojańczyk;SIAM J. Comput.,2008
4. Ambiguity in graphs and expressions;Book;IEEE Trans. Computers,1971
5. A. Brüggemann-Klein, M. Murata, D. Wood, Regular tree and regular hedge languages over unranked alphabets, Technical Report HKUST-TCSC-2001-0, The Hongkong University of Science and Technology, 2001