Weighted automata extend classical finite automata by assigning weights, typically drawn from algebraic structures such as semirings, to transitions. This quantitative enhancement enables the analysis ...

This paper develops a formalism within which the application of dynamic programming to discrete, deterministic problems is rigorously studied. The two central concepts underlying this development are ...