Forest FIRE and FIRE Wood: Tools for Tree Automata and Tree Algorithms
Loek Cleophas · Frontiers in artificial intelligence and applications · 2009
Pattern matching, acceptance, and parsing algorithms on node-labeled, ordered, ranked trees (‘tree algorithms’) are important for applications such as instruction selection and tree transformation/term rewriting. Many such algorithms have been developed. They often are based on results from such algorithms on words or generalizations thereof using finite (tree) automata. Regrettably no coherent, extensive toolkit of such algorithms and automata existed, complicating their use.