Review of Automaton Learning Algorithms with Polynomial Complexity -- Completely Solved Examples
<|reference_start|>Review of Automaton Learning Algorithms with Polynomial Complexity -- Completely Solved Examples: Automaton learning is a domain in which the target system is inferred by the automaton learning algorithm in the form of an automaton, by synthesizing a finite number of inputs and their corresponding outputs. Automaton learning makes use of a Minimally Adequate Teacher (MAT). The learner learns the target system by posing membership queries to the MAT. In this chapter, I have provided completely solved examples of automaton learning algorithms. According to the best of my knowledge these are not available in any other source.<|reference_end|>
@article{haneef2024review,
    title={Review of Automaton Learning Algorithms with Polynomial Complexity --
  Completely Solved Examples},
    author={Farah Haneef},
    journal={arXiv preprint arXiv:2404.11096},
    year={2024},
    archivePrefix={arXiv},
    eprint={2404.11096},
    primaryClass={cs.FL cs.CC}
}