Author:
van Heerdt Gerco,Kupke Clemens,Rot Jurriaan,Silva Alexandra
Abstract
AbstractIn this paper, we study active learning algorithms for weighted automata over a semiring. We show that a variant of Angluin’s seminal $$\mathtt {L}^{\!\star }$$
L
⋆
algorithm works when the semiring is a principal ideal domain, but not for general semirings such as the natural numbers.
Publisher
Springer International Publishing
Reference28 articles.
1. Fides Aarts, Paul Fiterau-Brostean, Harco Kuppens, and Frits W. Vaandrager. Learning register automata with fresh value generation. In Martin Leucker, Camilo Rueda, and Frank D. Valencia, editors, ICTAC, volume 9399 of LNCS, pages 165–183. Springer, 2015.
2. Cyril Allauzen, Mehryar Mohri, and Ameet Talwalkar. Sequence kernels for predicting protein essentiality. In William W. Cohen, Andrew McCallum, and Sam T. Roweis, editors, ICML, volume 307 of ACM International Conference Proceeding Series, pages 9–16. ACM, 2008.
3. Benjamin Aminof, Orna Kupferman, and Robby Lampert. Formal analysis of online algorithms. In Tevfik Bultan and Pao-Ann Hsiung, editors, ATVA, volume 6996 of LNCS, pages 213–227. Springer, 2011.
4. Dana Angluin. Learning regular sets from queries and counterexamples. Information and computation, 75(2):87–106, 1987.
5. Borja Balle and Mehryar Mohri. Spectral learning of general weighted automata via constrained matrix completion. In Peter L. Bartlett, Fernando C. N. Pereira, Christopher J. C.Burges, Léon Bottou, and Kilian Q. Weinberger, editors, NIPS, pages 2168–2176, 2012.
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On Learning Polynomial Recursive Programs;Proceedings of the ACM on Programming Languages;2024-01-05
2. Learning of Structurally Unambiguous Probabilistic Grammars;Logical Methods in Computer Science;2023-02-08
3. The Closer You Look, The More You Learn;Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security;2022-11-07
4. A Categorical Framework for Learning Generalised Tree Automata;Coalgebraic Methods in Computer Science;2022
5. A New Approach for Active Automata Learning Based on Apartness;Tools and Algorithms for the Construction and Analysis of Systems;2022