BookDOI
Handbook of Weighted Automata
TLDR
This book covers all the main aspects of weighted automata and formal power series methods, ranging from theory to applications, and presents a detailed survey of the state of the art and pointers to future research.Abstract:
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 This book covers all the main aspects of weighted automata and formal power series methods, ranging from theory to applications The contributors are the leading experts in their respective areas, and each chapter presents a detailed survey of the state of the art and pointers to future research The chapters in Part I cover the foundations of the theory of weighted automata, specifically addressing semirings, power series, and fixed point theory Part II investigates different concepts of weighted recognizability Part III examines alternative types of weighted automata and various discrete structures other than words Finally, Part IV deals with applications of weighted automata, including digital image compression, fuzzy languages, model checking, and natural-language processing Computer scientists and mathematicians will find this book an excellent survey and reference volume, and it will also be a valuable resource for students exploring this exciting research arearead more
Citations
More filters
Book ChapterDOI
Weighted Automata Algorithms
Mehryar Mohri,Mehryar Mohri +1 more
TL;DR: This chapter describes several fundamental weighted automata and shortest-distance algorithms including composition, determinization, minimization, and synchronization, as well as single-source and all-pairs shortest distance algorithms over general semirings.
Journal ArticleDOI
Weighted automata and weighted logics
Manfred Droste,Paul Gastin +1 more
TL;DR: A weighted version of MSO logic is introduced and it is proved that, for commutative semirings, the behaviours of weighted automata are precisely the formal power series definable with particular sentences of the authors' weighted logic.
Journal ArticleDOI
Phylogenetic quantification of intra-tumour heterogeneity.
TL;DR: MEDICC is presented, a method for phylogenetic reconstruction and heterogeneity quantification based on a Minimum Event Distance for Intra-tumour Copy-number Comparisons that outperforms state-of-the-art competitors in reconstruction accuracy, and additionally allows unbiased numerical quantification of tumour heterogeneity.
Proceedings Article
Semantics-Based Machine Translation with Hyperedge Replacement Grammars
TL;DR: An approach to semantics-based statistical machine translation that uses synchronous hyperedge replacement grammars to translate into and from graph-shaped intermediate meaning representations, to the authors' knowledge the first work in NLP to make use of synchronous context free graph Grammars.
Journal ArticleDOI
Automated reconstruction of ancient languages using probabilistic models of sound change
TL;DR: It is demonstrated by showing that the reconstructed Austronesian protolanguages provide compelling support for a hypothesis about the relationship between the function of a sound and its probability of changing that was first proposed in 1955.