Exact Searching for the Smallest Deterministic Automaton

[1]  Yasubumi Sakakibara,et al.  Learning context-free grammars using tabular representations , 2005, Pattern Recognit..

[2]  E. Mark Gold,et al.  Complexity of Automaton Identification from Given Data , 1978, Inf. Control..

[3]  Vladimir Ulyantsev,et al.  Finding All Minimum-Size DFA Consistent with Given Examples: SAT-Based Approach , 2017, SEFM Workshops.

[4]  Robert E. Tarjan,et al.  Variations on the Common Subexpression Problem , 1980, J. ACM.

[5]  Toby Walsh,et al.  SAT v CSP , 2000, CP.

[6]  Arlindo L. Oliveira,et al.  A new algorithm for exact reduction of incompletely specified finite state machines , 1999, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[7]  Wojciech Wieczorek,et al.  Grammatical Inference - Algorithms, Routines and Applications , 2016, Studies in Computational Intelligence.

[8]  Daniel Kroening,et al.  Decision Procedures , 2016, Texts in Theoretical Computer Science. An EATCS Series.

[9]  Frits W. Vaandrager,et al.  Model Learning as a Satisfiability Modulo Theories Problem , 2018, LATA.

[10]  E. Mark Gold,et al.  Language Identification in the Limit , 1967, Inf. Control..

[11]  G. Breukelen.  Analysis of covariance (ANCOVA) , 2010 .

[12]  Nikolaj Bjørner,et al.  Z3: An Efficient SMT Solver , 2008, TACAS.

[13]  Bruno Dutertre,et al.  A Fast Linear-Arithmetic Solver for DPLL(T) , 2006, CAV.

[14]  Marijn J. H. Heule,et al.  Exact DFA Identification Using SAT Solvers , 2010, ICGI.

[15]  Robert E. Tarjan,et al.  Efficiency of a Good But Not Linear Set Union Algorithm , 1972, JACM.

[16]  Jaikumar Radhakrishnan,et al.  Greed is good: Approximating independent sets in sparse and bounded-degree graphs , 1997, Algorithmica.

[17]  Colin de la Higuera,et al.  Grammatical Inference: Learning Automata and Grammars , 2010 .