Efficient algorithms for the inference of minimum size DFAs
From MaRDI portal
Publication:5945683
DOI10.1023/A:1010828029885zbMath0983.68105MaRDI QIDQ5945683
Arlindo L. Oliveira, João P. M. Silva
Publication date: 21 April 2002
Published in: Machine Learning (Search for Journal in Brave)
Related Items
Regular inference as vertex coloring, Inferring regular languages and \(\omega\)-languages, Synthesis of quantifier-free DNF sentences from inconsistent samples of strings with EF games and SAT, FSM inference from long traces, A multi-parameter analysis of hard problems on deterministic finite automata, LARS: a learning algorithm for rewriting systems, Inference of regular languages using state merging algorithms with search, Learning Meets Verification