The minimum consistent DFA problem cannot be approximated within and polynomial
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Cryptographic limitations on learning Boolean formulae and finite automata
Journal of the ACM (JACM)
Approximate graph coloring by semidefinite programming
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
ICGI '98 Proceedings of the 4th International Colloquium on Grammatical Inference
Languages and Machines: An Introduction to the Theory of Computer Science (3rd Edition)
Languages and Machines: An Introduction to the Theory of Computer Science (3rd Edition)
Handbook of Satisfiability: Volume 185 Frontiers in Artificial Intelligence and Applications
Handbook of Satisfiability: Volume 185 Frontiers in Artificial Intelligence and Applications
On the Synthesis of Finite-State Machines from Samples of Their Behavior
IEEE Transactions on Computers
Set Partitioning via Inclusion-Exclusion
SIAM Journal on Computing
3-coloring in time O (1.3289n)
Journal of Algorithms
Inference of regular languages using state merging algorithms with search
Pattern Recognition
Grammatical Inference: Learning Automata and Grammars
Grammatical Inference: Learning Automata and Grammars
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
Exact DFA identification using SAT solvers
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
Inferring network invariants automatically
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Enumerating maximal independent sets with applications to graph colouring
Operations Research Letters
Hi-index | 0.00 |
This paper is concerned with the problem of supervised learning of deterministic finite state automata, in the technical sense of identification in the limit from complete data, by finding a minimal DFA consistent with the data (regular inference). We solve this problem by translating it in its entirety to a vertex coloring problem. Essentially, such a problem consists of two types of constraints that restrict the hypothesis space: inequality and equality constraints. Inequality constraints translate to the vertex coloring problem in a very natural way. Equality constraints however greatly complicate the translation to vertex coloring. In previous coloring-based translations, these were therefore encoded either dynamically by modifying the vertex coloring instance on-the-fly, or by encoding them as satisfiability problems. We provide the first translation that encodes both types of constraints together in a pure vertex coloring instance. This offers many opportunities for applying insights from combinatorial optimization and graph theory to regular inference. We immediately obtain new complexity bounds, as well as a family of new learning algorithms which can be used to obtain both exact hypotheses, as well as fast approximations.