Learning Weighted Automata over Principal Ideal Domains

In this paper, we study active learning algorithms for weighted automata over a semiring. We show that a variant of Angluin’s seminal \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathtt {L}^{\!\star }$$\end{document}L⋆ algorithm works when the semiring is a principal ideal domain, but not for general semirings such as the natural numbers.

[1]  Henry J. Stephen Smith,et al.  XV. On systems of linear indeterminate equations and congruences , 1861, Philosophical Transactions of the Royal Society of London.

[2]  H. Smith.  I. On systems of linear indeterminate equations and congruences , 1862, Proceedings of the Royal Society of London.

[3]  N. Jacobson.  Lectures In Abstract Algebra , 1951 .

[4]  M. Orzech.  Onto Endomorphisms are Isomorphisms , 1971 .

[5]  Jack W. Carlyle,et al.  Realizations by Stochastic Finite Automata , 1971, J. Comput. Syst. Sci..

[6]  Dana Angluin,et al.  Learning Regular Sets from Queries and Counterexamples , 1987, Inf. Comput..

[7]  N. Jacobson,et al.  Basic Algebra II , 1989 .

[8]  Amir Pnueli,et al.  On the learnability of infinitary regular sets , 1991, COLT '91.

[9]  Jarkko Kari,et al.  Image compression using weighted finite automata , 1993, Comput. Graph..

[10]  Daniel Krob,et al.  The Equality Problem for Rational Series with Multiplicities in the tropical Semiring is Undecidable , 1992, Int. J. Algebra Comput..

[11]  Francesco Bergadano,et al.  Learning Behaviors of Automata from Multiplicity and Equivalence Queries , 1996, SIAM J. Comput..

[12]  Juan Miguel Vilar.  Query learning of subsequential transducers , 1996, ICGI.

[13]  公庄 庸三.  Basic Algebra = 代数学入門 , 2002 .

[14]  Fernando Pereira,et al.  Weighted Automata in Text and Speech Processing , 2005, ArXiv.

[15]  Ameet Talwalkar,et al.  Sequence kernels for predicting protein essentiality , 2008, ICML '08.

[16]  M. Leucker,et al.  Angluin-Style Learning of NFA , 2009, IJCAI.

[17]  Michele Boreale,et al.  Weighted Bisimulation in Linear Algebraic Form , 2009, CONCUR.

[18]  Roland Groz,et al.  Inferring Mealy Machines , 2009, FM.

[19]  Carlo Tomasi,et al.  ON LINEAR TRANSFORMATIONS , 2010 .

[20]  Orna Kupferman,et al.  Formal Analysis of Online Algorithms , 2011, ATVA.

[21]  Mehryar Mohri,et al.  Spectral Learning of General Weighted Automata via Constrained Matrix Completion , 2012, NIPS.

[22]  Frits W. Vaandrager,et al.  Learning Register Automata with Fresh Value Generation , 2015, ICTAC.

[23]  Bernhard Steffen,et al.  The Open-Source LearnLib - A Framework for Active Automata Learning , 2015, CAV.

[24]  Mehryar Mohri,et al.  Learning Weighted Automata , 2015, CAI.

[25]  SilvaAlexandra,et al.  Learning nominal automata , 2017 .

[26]  Alexandra Silva,et al.  Learning nominal automata , 2016, POPL.

[27]  Frits W. Vaandrager,et al.  Model learning , 2017, Commun. ACM.

[28]  Zvonimir Rakamaric,et al.  Releasing the PSYCO: Using Symbolic Search in Interface Generation for Java , 2017, SOEN.

[29]  Bernhard Steffen,et al.  Active Automata Learning in Practice - An Annotated Bibliography of the Years 2011 to 2016 , 2018, Machine Learning for Dynamic Software Analysis.

[30]  Optimizing Automata Learning via Monads. , 2017, 1704.08055.

[31]  Kim G. Larsen,et al.  L*-Based Learning of Markov Decision Processes , 2019, FM.