Learning Finite-State Machines from Inexperienced Teachers

@inproceedings{Grinchtein2006LearningFM,
  title={Learning Finite-State Machines from Inexperienced Teachers},
  author={Olga Grinchtein and Martin Leucker},
  booktitle={ICGI},
  year={2006}
}
The general goal of query-based learning algorithms for finite-state machines is to identify a machine, usually of minimum size, that agrees with an a priori fixed (class of) machines. For this, queries on how the underlying system behaves may be issued. A popular setup is that of Angluin’s L algorithm[Ang87], here adapted to the case of finite-state machines, in which a minimal deterministic finite-state machine for a regular language is learned based on so-called membership and equivalence… CONTINUE READING
4 Citations
5 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-5 of 5 references

Learning finite - state machines from inexperienced teachers

  • Martin Leucker
  • 2006

Efficient algorithms for the inference of minimum size dfas

  • Arlindo L. Oliveira, João P. Marques Silva
  • Machine Learning
  • 2001

Similar Papers

Loading similar papers…