A Backward and a Forward Simulation for Weighted Tree Automata

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.

• Type: Conference
• Year: 2009
• Where: CAI
• Authors: Andreas Maletti
• Keywords: CAI 2009, Informatics, Simulations, Weighted Tree Automata, Wta Process Trees