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...
Corporate Author: | |
---|---|
Other Authors: | , , |
Format: | Electronic |
Language: | English |
Published: |
Berlin, Heidelberg :
Springer Berlin Heidelberg,
2009.
|
Series: | Monographs in Theoretical Computer Science. An EATCS Series,
|
Subjects: | |
Online Access: | https://ezaccess.library.uitm.edu.my/login?url=http://dx.doi.org/10.1007/978-3-642-01492-5 |