@InProceedings{ BorjaMohri:AI:2015,
Author = "Balle, Borja and Mohri, Mehryar",
Editor = "Maletti, Andreas",
Abstract = "Weighted finite automata (WFA) are finite automata whose transitions and states are augmented with some weights, elements of a semiring. A WFA induces a function over strings. The value it assigns to an input string is the semiring sum of the weights of all paths labeled with that string, where the weight of a path is obtained by taking the semiring product of the weights of its constituent transitions, as well as those of its origin and destination states.",
Address = "Cham",
BookTitle = "Algebraic Informatics",
date-added = "2023-08-04 11:52:50 +0200",
date-modified = "2023-08-04 11:53:02 +0200",
ISBN = "978-3-319-23021-4",
Pages = "1--21",
Publisher = "Springer International Publishing",
Title = "Learning Weighted Automata",
Year = "2015",
File = "Learning Weighted Automata - 978-3-319-23021-4\_1.pdf"
}
Library Size: 13G (12941 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A