2017/05/30 by Rick Smetsers, Smetsers, Rick
Computer Science · #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Logic in Computer Science (cs.LO) #Machine Learning (cs.LG) #cs.FL #cs.LG #cs.LO
paper · pdf · doi:10.48550/arxiv.1705.10639
Submitted and selected for oral presentation at the LearnAut workshop at LICS 2017
arxiv created 2017/05/30 · arxiv updated 2017/05/31
The problem of learning a minimal consistent model from a set of labeled sequences of symbols is addressed from a satisfiability modulo theories perspective. We present two encodings for deterministic finite automata and extend one of these for Moore and Mealy machines. Our experimental results show that these encodings improve upon the state-of-the-art, and are useful in practice for learning small models.