2000 character limit reached
Learning Weighted Automata over Principal Ideal Domains
Published 11 Nov 2019 in cs.FL | (1911.04404v2)
Abstract: In this paper, we study active learning algorithms for weighted automata over a semiring. We show that a variant of Angluin's seminal \LStar\ algorithm works when the semiring is a principal ideal domain, but not for general semirings such as the natural numbers.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.