Handbook of Weighted Automata

Random Post

• How Mass Collaboration Changes Everything
• How Mass Collaboration Changes Everything Publisher : Portfolio Hardcover | 2006-12-28 | ISBN : 159
• Measurement Challenges in Atmospheric Chemistry (Advances in Chemistry Series)
• Measurement Challenges in Atmospheric Chemistry (Advances in Chemistry Series) Presents discussions
• Building Dynamic Websites – Lecture 9 – javascript (continued)
• Building Dynamic Websites – Lecture 9 – javascript (continued) Professor David J. Malan discusses t
• Microsoft Data Protection Manager 2010
• This book is a practical, step-by-step tutorial to planning deployment, installing, configuring, an
• Urban Outfitters Catalog
• Photo: http://freecatalogs.blogspot.com/2009/04/urban-outfitters-catalog.html

Внимание! У вас нет прав для просмотра скрытого текста. Description: 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. Weights can also be added to classical automata with infinite state sets like pushdown automata, and this extension constitutes the general concept of weighted automata. Since their introduction in the 1960s they have stimulated research in related areas of theoretical computer science, including formal language theory, algebra, logic, and discrete structures. Moreover, weighted automata and weighted context-free grammars have found application in natural-language processing, speech recognition, and digital image compression.

http://www.dbebooks.biz/ebooks/computers__internet/12284-handbook-of-weighted-automata.html