The Inclusion Problem for Weighted Automata on Infinite Trees
Stefan Borgwardt, Rafael Peñaloza · BOA (University of Milano-Bicocca) · 2011
Weighted automata can be seen as a natural generalization of finite state automata to more complex algebraic structures. The standard reasoning tasks for unweighted automata can also be generalized to the weighted setting. In this paper we study the problems of intersection, complementation and inclusion for weighted automata on infinite trees and show that they are not harder complexity-wise than reasoning with unweighted automata. We also present explicit methods for solving these problems optimally.