Efficient Learning of Typical Finite Automata from Random Walks

This publication has 23 references indexed in Scilit:

• Inferring finite automata with stochastic output functions and an application to map learning
  Machine Learning, 1995
• Predicting {0, 1}-Functions on Randomly Drawn Points
  Information and Computation, 1994
• New approximation algorithms for graph coloring
  Journal of the ACM, 1994
• Universal prediction of individual sequences
  IEEE Transactions on Information Theory, 1992
• Biased random walks
  Published by Association for Computing Machinery (ACM) ,1992
• Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
  SIAM Journal on Computing, 1988
• Learning regular sets from queries and counterexamples
  Information and Computation, 1987
• On the complexity of minimum inference of regular sets
  Information and Control, 1978
• Complexity of automaton identification from given data
  Information and Control, 1978
• System identification via state characterization
  Automatica, 1972