In this work, we review an algorithm that learns a Büchi automaton from a teacher who knows an ω -regular language; the algorithm is based on learning a formalism named family of DFAs (FDFAs) recently proposed by Angluin and Fisman. We introduce the learning algorithm by learning the simple ω -regular language (ab) ω: besides giving the readers an overview of the algorithm, it guides them on how the algorithm works step by step. Further, we demonstrate how the learning algorithm can be exploited in classical automata operations such as complementation checking and in the context of termination analysis.
CITATION STYLE
Li, Y., Turrini, A., Chen, Y. F., & Zhang, L. (2019). Learning Büchi Automata and Its Applications. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11430 LNCS, pp. 38–98). Springer Verlag. https://doi.org/10.1007/978-3-030-17601-3_2
Mendeley helps you to discover research relevant for your work.