Backward and forward bisimulation minimisation of tree automata (2007)
Cached
Download Links
- [www.isi.edu]
- [wwwtcs.inf.tu-dresden.de]
- [www.springerlink.com]
- [wwwtcs.inf.tu-dresden.de]
- DBLP
Other Repositories/Bibliography
by
Johanna Högberg
,
Andreas Maletti
,
Jonathan May
| Citations: | 9 - 6 self |
BibTeX
@TECHREPORT{Högberg07backwardand,
author = {Johanna Högberg and Andreas Maletti and Jonathan May},
title = {Backward and forward bisimulation minimisation of tree automata},
institution = {},
year = {2007}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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.
