Handbook of Weighted Automata

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Droste, Manfred (Επιμελητής έκδοσης), Kuich, Werner (Επιμελητής έκδοσης), Vogler, Heiko (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2009.
• Σειρά: Monographs in Theoretical Computer Science. An EATCS Series,
• Θέματα: Computer science.; Computers.; Computer logic.; Mathematical logic.; Computational linguistics.; Computer Science.; Theory of Computation.; Logics and Meanings of Programs.; Language Translation and Linguistics.; Mathematical Logic and Formal Languages.; Computation by Abstract Devices.; Mathematical Logic and Foundations.

The purpose of this Handbook is to highlight both theory and applications of weighted automata. Weighted finite automata are classical nondeterministic finite automata in which the transitions carry weights. These weights may model, e. g. , the cost involved when executing a transition, the amount o...

Πίνακας περιεχομένων:

• Foundations
• Semirings and Formal Power Series
• Fixed Point Theory
• Concepts of Weighted Recognizability
• Finite Automata
• Rational and Recognisable Power Series
• Weighted Automata and Weighted Logics
• Weighted Automata Algorithms
• 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
• Applications
• Digital Image Compression
• Fuzzy Languages
• Model Checking Linear-Time Properties of Probabilistic Systems
• Applications of Weighted Automata in Natural Language Processing.