Now showing items 1-1 of 1

    • The Inclusion Problem for Weighted Automata on Infinite Trees 

      Borgwardt, S; Penaloza, R (Institute of Mathematics and Computer Science of Nyíregyháza College, 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. ...