ItemDesc two libraries written in Ocaml for manipulating ranked and unranked tree automata. The first one is a library for manipulating binary tree automata ( see the readme file,the bibliography and the TATA's book for more explanations ), i.e. classical tree automata which runs on binary trees. The second one is a library for manipulating unranked tree automata, called stepwise automata (see the readme file, the bibliography and the abstract for more explanations). This one uses the first one. The libraries are designed for Findlib, a package manager for Ocaml.
References Julien Carme, Joachim Niehren and Marc Tommasi.Querying Unranked Trees with Stepwise Tree Automata.2004.