Communications of the ACM
Information Processing Letters
Learning regular sets from queries and counterexamples
Information and Computation
Optimization, approximation, and complexity classes
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Computational limitations on learning from examples
Journal of the ACM (JACM)
Crytographic limitations on learning Boolean formulae and finite automata
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Negative Results for Equivalence Queries
Machine Learning
On the learnability of finite automata
COLT '88 Proceedings of the first annual workshop on Computational learning theory
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Equivalence of models for polynomial learnability
Information and Computation
SIAM Journal on Computing
On the necessity of Occam algorithms
Theoretical Computer Science
The Complexity of Near-Optimal Graph Coloring
Journal of the ACM (JACM)
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
An application of the theory of computational complexity to the study of inductive inference.
An application of the theory of computational complexity to the study of inductive inference.
On the necessity of Occam algorithms
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Efficient learning of typical finite automata from random walks
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Diversity-based inference of finite automata
Journal of the ACM (JACM)
On learning bounded-width branching programs
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
Property testing and its connection to learning and approximation
Journal of the ACM (JACM)
Synthesis of Supervisors Using Learning Algorithm of RegularLanguages
Discrete Event Dynamic Systems
Efficient Algorithms for the Inference of Minimum Size DFAs
Machine Learning
On Sufficient Conditions to Identify in the Limit Classes of Grammars from Polynomial Time and Data
ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
Inferring Deterministic Linear Languages
COLT '02 Proceedings of the 15th Annual Conference on Computational Learning Theory
Learning Local Transductions Is Hard
Journal of Logic, Language and Information
Uniquely decodable n-gram embeddings
Theoretical Computer Science
Probabilistic Finite-State Machines-Part II
IEEE Transactions on Pattern Analysis and Machine Intelligence
Learning Deterministic Finite Automata with a Smart State Labeling Evolutionary Algorithm
IEEE Transactions on Pattern Analysis and Machine Intelligence
Minimizing nfa's and regular expressions
Journal of Computer and System Sciences
A more bio-plausible approach to the evolutionary inference of finite state machines
Proceedings of the 9th annual conference companion on Genetic and evolutionary computation
Application of automata learning algorithms to robot motion tracking
ISPRA'05 Proceedings of the 4th WSEAS International Conference on Signal Processing, Robotics and Automation
Kernel methods for learning languages
Theoretical Computer Science
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Learning Languages from Bounded Resources: The Case of the DFA and the Balls of Strings
ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications
Polynomial Distinguishability of Timed Automata
ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications
Journal of Automata, Languages and Combinatorics
Grammar-based classifier system: a universal tool for grammatical inference
WSEAS Transactions on Computers
Grammatical inference and computational linguistics
CLAGI '09 Proceedings of the EACL 2009 Workshop on Computational Linguistic Aspects of Grammatical Inference
A bibliographical study of grammatical inference
Pattern Recognition
Inference of regular languages using state merging algorithms with search
Pattern Recognition
A local search algorithm for grammatical inference
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
Synoptic: summarizing system logs with refinement
SLAML'10 Proceedings of the 2010 workshop on Managing systems via log analysis and machine learning techniques
Leveraging existing instrumentation to automatically infer invariant-constrained models
Proceedings of the 19th ACM SIGSOFT symposium and the 13th European conference on Foundations of software engineering
Learning linearly separable languages
ALT'06 Proceedings of the 17th international conference on Algorithmic Learning Theory
EPIA'05 Proceedings of the 12th Portuguese conference on Progress in Artificial Intelligence
Finding small OBDDs for incompletely specified truth tables is hard
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
On the complexity of error explanation
VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
COLT'05 Proceedings of the 18th annual conference on Learning Theory
Minimizing NFA's and regular expressions
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
Using MDL for grammar induction
ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
Approximating deterministic lattice automata
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
On the learnability of shuffle ideals
ALT'12 Proceedings of the 23rd international conference on Algorithmic Learning Theory
On the learnability of shuffle ideals
The Journal of Machine Learning Research
| Hi-index | 0.01 |
The minimum consistent DFA problem is that of finding a DFA with as few states as possible that is consistent with a given sample (a finite collection of words, each labeled as to whether the DFA found should accept or reject). Assuming that P ≠ NP, it is shown that for any constant k, no polynomial-time algorithm can be guaranteed to find a consistent DFA with fewer than optk states, where opt is the number of states in the minimum state DFA consistent with the sample. This result holds even if the alphabet is of constant size two, and if the algorithm is allowed to produce an NFA, a regular expression, or a regular grammar that is consistent with the sample. A similar nonapproximability result is presented for the problem of finding small consistent linear grammars. For the case of finding minimum consistent DFAs when the alphabet is not of constant size but instead is allowed to vary with the problem specification, the slightly stronger lower bound on approximability of opt(1-&egr;)log logopt is shown for any &egr; 0.