A Backward and a Forward Simulation for Weighted Tree Automata

Authors:
Andreas Maletti
Affiliations:
Departament de Filologies Romàniques, Universitat Rovira i Virgili, Tarragona, Spain 43002
Venue:
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
Year:
2009

Citing 12
Cited 1

Regular Tree Model Checking

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Determinization of finite state weighted tree automata

Journal of Automata, Languages and Combinatorics
Minimizing nfa's and regular expressions

Journal of Computer and System Sciences
Composed Bisimulation for Tree Automata

CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
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)
Backward and forward bisimulation minimization of tree automata

Theoretical Computer Science
Minimizing deterministic weighted tree automata

Information and Computation
Inapproximability of nondeterministic state and transition complexity assuming P ≠ NP

DLT'07 Proceedings of the 11th international conference on Developments in language theory
Bisimulation minimisation for weighted tree automata

DLT'07 Proceedings of the 11th international conference on Developments in language theory
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
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

Minimizing weighted tree grammars using simulation

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Two types of simulations for weighted tree automata (wta) are considered. Wta process trees and assign a weight to each of them. The weights are taken from a semiring. The two types of simulations work for wta over additively idempotent, commutative semirings and can be used to reduce the size of wta while preserving their semantics. Such reductions are an important tool in automata toolkits.