Backward and forward bisimulation minimization of tree automata

Johanna Högberg, Andreas Maletti, Jonathan May
2009 Theoretical Computer Science  
] bisimulation minimization algorithm for finite-state tree automata by introducing backward and forward bisimulation and developing minimization algorithms for them. Minimization via forward bisimulation is also effective on deterministic tree automata, faster than the previous algorithm, and yields the minimal equivalent deterministic tree automaton. Minimization via backward bisimulation generalizes the previous algorithm and can yield smaller automata but is just as fast. We demonstrate
more » ... ementations of these algorithms on a typical task in natural language processing.
doi:10.1016/j.tcs.2009.03.022 fatcat:xwzqbdemzfhwlabn4nksa5l2ce