RX: an interpreter for Rational Tree Languages

The RX system handles finite automata on trees.

RX exploits functional programming in two ways. First, tree automata and their operations are described in a small functional language. Second, RX is implemented in the higher-order lazy functional language Haskell.

Also see the RX home page