Backward and forward bisimulation minimization of tree automata

Authors:
Johanna Högberg;Andreas Maletti;Jonathan May
Affiliations:
Department of Computing Science, Umeå University, SE 90187 Umeå, Sweden;International Computer Science Institute, 1947 Center Street, Suite 600, Berkeley, CA 94704, USA;Information Sciences Institute, University of Southern California, Marina Del Rey, CA 90292, USA
Venue:
Theoretical Computer Science
Year:
2009

Citing 14
Cited 10

Three partition refinement algorithms

SIAM Journal on Computing
Regular languages

Handbook of formal languages, vol. 1
Tree languages

Handbook of formal languages, vol. 3
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
Minimizing nfa's and regular expressions

Journal of Computer and System Sciences
Bisimulation relations for weighted automata

Theoretical Computer Science
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)
Inapproximability of nondeterministic state and transition complexity assuming P ≠ NP

DLT'07 Proceedings of the 11th international conference on Developments in language theory
Tiburon: a weighted tree automata toolkit

CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Bisimulation minimization of tree automata

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

A Backward and a Forward Simulation for Weighted Tree Automata

CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
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
Pushing for weighted tree automata

MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Bisimulations for fuzzy automata

Fuzzy Sets and Systems
Learning rational functions

DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Computation of the greatest simulations and bisimulations between fuzzy automata

Fuzzy Sets and Systems
Hyper-minimization for deterministic tree automata

CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
Hyper-optimization for deterministic tree automata

CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
Nondeterministic automata: Equivalence, bisimulations, and uniform relations

Information Sciences: an International Journal

Quantified Score

Hi-index	5.23

Visualization

Abstract

We improve on an existing [P.A. Abdulla, J. Hogberg, L. Kaati, Bisimulation minimization of tree automata, International Journal of Foundations of Computer Science 18(4) (2007) 699-713] 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 implementations of these algorithms on a typical task in natural language processing.