1. Lecture Notes in Computer Science;S. Bardin,2006
2. Bollig, B., Habermehl, P., Kern, C., Leucker, M.: Angluin-Style Learning of NFA. In: Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI 2009), Pasadena, CA, USA, July 2009, pp. 1004–1009. AAAI Press, Menlo Park (2009)
3. Lecture Notes in Computer Science;A. Boudet,1996
4. Büchi, J.: Weak second-order Arithmetic and Finite Automata. Zeitschrift fur Mathematische Logik und Grundlagen der Mathematik 6, 66–92 (1960)
5. Cooper, D.C.: Theorem Proving in Arithmetic without Multiplication. In: Machine Intelligence, pp. 91–100 (1972)