Random DFA's can be approximately learned from sparse uniform examples

This publication has 5 references indexed in Scilit:

• Crytographic limitations on learning Boolean formulae and finite automata
  Published by Association for Computing Machinery (ACM) ,1989
• The minimum consistent DFA problem cannot be approximated within and polynomial
  Published by Association for Computing Machinery (ACM) ,1989
• Random number generators: good ones are hard to find
  Communications of the ACM, 1988
• On the complexity of minimum inference of regular sets
  Information and Control, 1978
• Inference of Sequential Machines from Sample Computations
  IEEE Transactions on Computers, 1978