116
click to vote
FCT
2009
Springer
15 years 9 months ago
2009
Springer
Weighted automata are finite automata with numerical weights on transitions. Nondeterministic weighted automata define quantitative languages L that assign to each word w a real ...