LETHAL welcomes you to the world of finite tree automata!
LETHAL is a Java library for working with finite tree and hedge automata. It supports a great variety of regular tree language operations and property
evaluations. More advanced concepts like tree homomorphisms and transducers are also supported.
Additionally the library comes with a scriptable graphical user interface to get started quickly.
The concept of finite tree automata is to examine regular languages of trees, which are specially constructed sets of trees.
LETHAL has been developed by students at the University of Muenster, in association with the
Software Construction and Verification group.
Authors: Philipp Claves, Dorothea Jansen, Sezar Jarrous Holtrup, Martin Mohr, Anton Reis, Maria Schatz, Irene Thesing
To get LETHAL, click here