Taja 2.0 is a graphic tool which makes it possible to handle tree-tuple automata. TAJA 2.0 is the new version of TAJA 1.0 developed by Fabrice Leblois and Arnaud Lauret at the University of Angers in 2000. The new version has been developed at LIFO. Bugs have been removed and the possibility of handling regular relations has been added.

When the length of tree-tuples is 1, TAJA deals with classical finite tree automata. Otherwise TAJA deals with regular relations, i.e with finite tree automata over the product alphabet (for more details see the notion called Rec in TATA ).

 
 

The principal operations are : Union Intersection Complement Emptyness Equivalence Projection Join

Download

taja.tar.gz contains all the files *.class you need to use TAJA. It contains also the README file.

tajalib.tar.gz contains all the files *.java you need to compile TAJA.

License

  TAJA is freely available, under the terms of the GNU LIBRARY GENERAL PUBLIC LICENSE.

Bugs reports and Comments

Please to report bugs and comments to Pierre Réty