Algorithms for Learning Finite Automata from Queries: A Unified View

This publication has 13 references indexed in Scilit:

• Adaptive logspace reducibility and parallel time
  Theory of Computing Systems, 1995
• The query complexity of learning DFA
  New Generation Computing, 1994
• An Introduction to Computational Learning Theory
  Published by MIT Press ,1994
• Inference of Finite Automata Using Homing Sequences
  Information and Computation, 1993
• The VC-dimensions of finite automata with n states
  Published by Springer Nature ,1993
• Asking questions to minimize errors
  Published by Association for Computing Machinery (ACM) ,1993
• On the exact learning of formulas in parallel
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1992
• Inductive inference, DFAs, and computational complexity
  Published by Springer Nature ,1989
• Learning regular sets from queries and counterexamples
  Information and Computation, 1987
• On bounded query machines
  Theoretical Computer Science, 1985