We consider the problem of learning a finite automaton M of n states with input alphabet X and output alphabet Y when a teacher has helpfully or randomly labeled the states of M u...
Dana Angluin, Leonor Becerra-Bonache, Adrian Horia...
Abstract. Stochastic deterministic finite automata have been introduced and are used in a variety of settings. We report here a number of results concerning the learnability of th...
We propose and analyze a distribution learning algorithm for a subclass of Acyclic Probabilistic Finite Automata (APFA). This subclass is characterized by a certain distinguishabi...
In regular inference, the problem is to infer a regular language, typically represented by a deterministic finite automaton (DFA) from answers to a finite set of membership querie...
Abstract. Active language learning is an interesting task for which theoretical results are known and several applications exist. In order to better understand what the better stra...
David Combe, Colin de la Higuera, Jean-Christophe ...