Backward and forward bisimulation minimisation of tree automata

Authors:
Johanna Högberg;Andreas Maletti;Jonathan May
Affiliations:
Dept. of Computing Science, Umeå University, Umeå, Sweden;Faculty of Computer Science, Technische Universität Dresden, Dresden, Germany;Information Sciences Institute, University of Southern California, Marina Del Rey, CA
Venue:
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Year:
2007

Citing 8
Cited 11

Three partition refinement algorithms

SIAM Journal on Computing
Regular Tree Model Checking

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Building a large annotated corpus of English: the penn treebank

Computational Linguistics - Special issue on using large corpora: II
A syntax-based statistical translation model

ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
The equivalence problem for regular expressions with squaring requires exponential space

SWAT '72 Proceedings of the 13th Annual Symposium on Switching and Automata Theory (swat 1972)
Tiburon: a weighted tree automata toolkit

CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
An overview of probabilistic tree transducers for natural language processing

CICLing'05 Proceedings of the 6th international conference on Computational Linguistics and Intelligent Text Processing
Minimizing NFA's and regular expressions

STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science

Composed Bisimulation for Tree Automata

CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata

Electronic Notes in Theoretical Computer Science (ENTCS)
Minimizing deterministic weighted tree automata

Information and Computation
Computing simulations over tree automata: efficient techniques for reducing tree automata

TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Fuzzy relation equations and reduction of fuzzy automata

Journal of Computer and System Sciences
On the greatest solutions to weakly linear systems of fuzzy relation inequalities and equations

Fuzzy Sets and Systems
Minimizing weighted tree grammars using simulation

FSMNLP'09 Proceedings of the 8th international conference on Finite-state methods and natural language processing
Bisimulations for fuzzy automata

Fuzzy Sets and Systems
Bisimulation Minimisation of Weighted Automata on Unranked Trees

Fundamenta Informaticae
Computation of the greatest simulations and bisimulations between fuzzy automata

Fuzzy Sets and Systems
Nondeterministic automata: Equivalence, bisimulations, and uniform relations

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

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.