Access the full text.
Sign up today, get DeepDyve free for 14 days.
C. Lund, M. Yannakakis (1994)
On the hardness of approximating minimization problemsJ. ACM, 41
M. Kearns, U. Vazirani (1994)
An Introduction to Computational Learning Theory
B. Trakhtenbrot, I︠a︡. Barzdinʹ (1973)
Finite automata : behavior and synthesis
R. Gavald`a, D. Guijarro (1995)
Proceedings of the 6th International Workshop on Algorithmic Learning Theory
Kevin Lang (1992)
Random DFA's can be approximately learned from sparse uniform examples
H. Simon (1990)
On Approximate Solutions for Combinatorial Optimization ProblemsSIAM J. Discret. Math., 3
Y. Takenaga, S. Yajima (1993)
NP-completeness of minimum binary decision diagram identification
L. Pitt, Manfred Warmuth (1989)
The minimum consistent DFA problem cannot be approximated within any polynomial[1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference
O. Coudert, C. Berthet, J. Madre (1989)
Verification of Synchronous Sequential Machines Based on Symbolic Execution
(1994)
An approximation preserving reduction from graph coloring to the consistency problem of OBDDs
Yasuhiko Takenaga, S. Yajima (1993)
NP-completeness of Minimum Binary Decision Diagram Identification Problems
R. Bryant (1992)
Symbolic Boolean manipulation with ordered binary-decision diagramsACM Comput. Surv., 24
Ricard Gavaldà, David Guijarro (1995)
Learning Ordered Binary Decision Diagrams
R. Rivest, R. Schapire (1989)
Inference of finite automata using homing sequencesInf. Comput., 103
Detlef Sieling, I. Wegener (1993)
Reduction of OBDDs in Linear TimeInf. Process. Lett., 48
L. Pitt, Manfred Warmuth (1989)
The minimum consistent DFA problem cannot be approximated within and polynomial
D. Angluin (1987)
Learning Regular Sets from Queries and CounterexamplesInf. Comput., 75
Temple Smith (1980)
Occam's razorNature, 285
F. Somenzi (1999)
Binary Decision Diagrams
J. Hopcroft (1971)
An n log n algorithm for minimizing states in a finite automaton
A. Aho, J. Hopcroft, J. Ullman (1974)
The Design and Analysis of Computer Algorithms
(1997)
Endbericht der Projektgruppe “Algorithmische Lernstrategien als Werkzeug für kombinatorische Optimierung
J.E. Hopcroft, R.M. Karp (1971)
An algorithm for testing the equivalence of finite automata
L. Valiant (1984)
A theory of the learnableCommunications of the ACM, 27
R. Bryant (1989)
Graph-based Algorithm for Boolean Function ManipulationIEEE Transactions on Computers
C. Lee (1959)
Representation of switching circuits by binary-decision programsBell System Technical Journal, 38
David Editor
Artificial Intelligence and Language Processing a Theory of the Learnable
E. Gold (1978)
Complexity of Automaton Identification from Given DataInf. Control., 37
J.E. Hopcroft (1971)
Theory of Machines and Computations
M. Kearns, L. Valiant (1994)
Cryptographic limitations on learning Boolean formulae and finite automata
In this paper, we describe how a basic strategy from computational learning theory can be used to attack a class of NP‐hard combinatorial optimization problems. It turns out that the learning strategy can be used as an iterative booster: given a solution to the combinatorial problem, we will start an efficient simulation of a learning algorithm which has a “good chance” to output an improved solution. This boosting technique is a new and surprisingly simple application of an existing learning strategy. It yields a novel heuristic approach to attack NP‐hard optimization problems. It does not apply to each combinatorial problem, but we are able to exactly formalize some sufficient conditions. The new technique applies, for instance, to the problems of minimizing a deterministic finite automaton relative to a given domain, the analogous problem for ordered binary decision diagrams, and to graph coloring.
Annals of Mathematics and Artificial Intelligence – Springer Journals
Published: Oct 4, 2004
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.