Three partition refinement algorithms
SIAM Journal on Computing
Handbook of formal languages, vol. 3
A Calculus of Communicating Systems
A Calculus of Communicating Systems
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)
Learning deterministically recognizable tree series
Journal of Automata, Languages and Combinatorics
The myhill-nerode theorem for recognizable tree series
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Bisimulation minimization of tree automata
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Minimizing NFA's and regular expressions
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Bisimulation Minimisation of Weighted Automata on Unranked Trees
Fundamenta Informaticae
A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
A Backward and a Forward Simulation for Weighted Tree Automata
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
Minimizing weighted tree grammars using simulation
FSMNLP'09 Proceedings of the 8th international conference on Finite-state methods and natural language processing
Simulations of weighted tree automata
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Pushing for weighted tree automata
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Bisimulation Minimisation of Weighted Automata on Unranked Trees
Fundamenta Informaticae
| Hi-index | 0.00 |
We generalise existing forward and backward bisimulation minimisation algorithms for tree automata to weighted tree automata. The obtained algorithms work for all semirings and retain the time complexity of their unweighted variants for all additively cancellative semirings. On all other semirings the time complexity is slightly higher (linear instead of logarithmic in the number of states). We discuss implementations of these algorithms on a typical task in natural language processing.