Learning Weighted Automata over Principal Ideal Domains
Abstract
In this paper, we study active learning algorithms for weighted automata over a semiring. We show that a variant of Angluin's seminal \ algorithm works when the semiring is a principal ideal domain, but not for general semirings such as the natural numbers.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.