ELAN - Tree Automata Library

LORIA: CNRS, INRIA, Universities of Nancy

In this page we present the Tree Automata Library developed in ELAN. This library include basic Tree Automata operations such as intersection, union, cleaning etc. as well as matching ans approximation operations described in:

T. Genet. Decidable approximations of sets of descendants and sets of normal forms. In Proceedings 9th Conference on Rewriting Techniques and Applications, Tsukuba (Japan), volume 1379 of Lecture Notes in Computer Science, pages 151-165. Springer-Verlag, 1998.

The library can be used such as any ELAN module or as an independent ELAN program through the following three different interfaces:

For basic Tree Automata operations: intersection, union, cleaning, etc. use the interface automaton.lgi.
For computing approximation automata for sets of descendants, sets of normal forms (see [1]) or automaton recognising sets of irreducible terms use the interface nf_automaton.lgi.
For proving termination of the sequential reduction relation (see [1]) use the interface termination.lgi.

The complete distribution of the library is now part of the ELAN version 3.3 distribution but it can also be independently downloaded here. Please, first read the README file included of the distribution.

Report any question, remark or bug to the author Thomas.Genet@loria.fr,