Abstract
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. © Springer-Verlag Berlin Heidelberg 2007.
Author supplied keywords
Cite
CITATION STYLE
Högberg, J., Maletti, A., & May, J. (2007). Backward and forward bisimulation minimisation of tree automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4783 LNCS, pp. 109–121). Springer Verlag. https://doi.org/10.1007/978-3-540-76336-9_12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
