Handbook of Weighted Automata

• Corporate Author: SpringerLink (Online service)
• Other Authors: Droste, Manfred. (Editor), Kuich, Werner. (Editor), Vogler, Heiko. (Editor)
• Format: Electronic
• Language: English
• Published: Berlin, Heidelberg : Springer Berlin Heidelberg, 2009.
• Series: Monographs in Theoretical Computer Science. An EATCS Series,
• Subjects: Computer science.; Artificial intelligence.; Logic, Symbolic and mathematical.; Computer Science.; Mathematical Logic and Formal Languages.; Computation by Abstract Devices.; Mathematical Logic and Foundations.; Mathematics of Computing.; Artificial Intelligence (incl. Robotics).
• Online Access: https://ezaccess.library.uitm.edu.my/login?url=http://dx.doi.org/10.1007/978-3-642-01492-5

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...

Table of Contents:

• Part I, Foundations: Semirings and Formal Power Series
• Fixed Point Theory. Part II, Concepts of Weighted Recognizability: Finite Automata
• Rational and Recognisable Power Series
• Weighted Automata and Weighted Logics
• Weighted Automata Algorithms. Part III, Weighted Discrete Structures: Algebraic Systems and Pushdown Automata
• Lindenmayer Systems
• Weighted Tree Automata and Tree Transducers
• Traces, Series-Parallel Posets, and Pictures: A Weighted Study. Part IV, Applications: Digital Image Compression
• Fuzzy Languages
• Model Checking Linear-Time Properties of Probabilistic Systems
• Applications of Weighted Automata in Natural Language Processing. Index.