Handbook of weighted automata

Weighted finite automata are classical nondeterministic finite automata in which the transitions carry weights. These weights may model, for example, the cost involved when executing a transition, the resources or time needed for this, or the probability or reliability of its successful execution. W...

Full description

Other Authors: Droste, Manfred, 1956-, Kuich, Werner, 1941-, Vogler, Heiko, 1957-, SpringerLink (Online service)
Format: eBook
Language: English
Published: Berlin : Springer, ©2009.
Berlin : [2009]
Physical Description: 1 online resource (xvii, 608 pages) : illustrations.
Series: Monographs in theoretical computer science.
Subjects:

CMU Electronic Access

Electronic Resource Click Here
LocationCall Number: Status
CMU Electronic Access Available