Learning Weighted Automata over Principal Ideal Domains
Formal Languages and Automata Theory
2021-10-15 v2
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.
Keywords
Cite
@article{arxiv.1911.04404,
title = {Learning Weighted Automata over Principal Ideal Domains},
author = {Gerco van Heerdt and Clemens Kupke and Jurriaan Rot and Alexandra Silva},
journal= {arXiv preprint arXiv:1911.04404},
year = {2021}
}