Sciweavers

Share
WIA
2007
Springer

Backward and Forward Bisimulation Minimisation of Tree Automata

9 years 4 months ago
Backward and Forward Bisimulation Minimisation of Tree Automata
We improve an existing bisimulation minimisation algorithm for tree automata by introducing backward and forward bisimulations and developing minimisation algorithms for them. Minimisation via forward bisimulation is also effective for deterministic automata and faster than the previous algorithm. Minimisation via backward bisimulation generalises the previous algorithm and is thus more effective but just as fast. We demonstrate implementations of these algorithms on a typical task in natural language processing.
Johanna Högberg, Andreas Maletti, Jonathan Ma
Added 09 Jun 2010
Updated 09 Jun 2010
Type Conference
Year 2007
Where WIA
Authors Johanna Högberg, Andreas Maletti, Jonathan May
Comments (0)
books