Learning finite cover automata from queries

Journal of Computer and System Sciences

Volumn 78, Issue 1, 2012, Pages 221-244

  Ipate, Florentin ^a  

^a UNIVERSITY OF PITESTI   (Romania)

Author keywords

Automata inference; Deterministic finite cover automata; Finite automata; Learning from queries

Indexed keywords

FINITE AUTOMATA; INFERENCE ENGINES; POLYNOMIAL APPROXIMATION;

AUTOMATA INFERENCE; DETERMINISTIC FINITE COVER AUTOMATON; FINITE LANGUAGES; INFERENCE METHODS; LEARNING FROM QUERIES; LEARNING REGULAR LANGUAGES; MINIMAL AUTOMATON; POLYNOMIAL-TIME;

ROBOTS;

EID: 81955160832     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2011.04.002     Document Type: Conference Paper

References (31)

1. E.M. Clarke Jr., O. Grumberg, and D.A. Peled Model Checking 1999 MIT Press
2. D. Lee, M. Yannakakis, Principles and methods of testing finite state machines-A survey, in: Proceedings of the IEEE, vol. 84, 1996, pp. 1090-1126.
3. D. Angluin Learning regular sets from queries and counterexamples Inform. and Comput. 75 2 1987 87 106 (Pubitemid 18535066)
4. E. Gold Language identification in the limit Inform. Control 10 1967 447 474
5. J.L. Balcázar, J. Díaz, R. Gavaldà, Algorithms for learning finite automata from queries: A unified view, in: Advances in Algorithms, Languages, and, Complexity, 1997, pp. 53-72.
6. M. Kearns, and U. Vazirani An Introduction to Computational Learning Theory 1994 MIT Press
7. R.L. Rivest, R.E. Schapire, Inference of finite automata using homing sequences, in: Machine Learning: From Theory to Applications, 1993, pp. 51-73.
8. H. Hungar, O. Niese, B. Steffen, Domain-specific optimization in automata learning, in: CAV, 2003, pp. 315-327.
9. T. Berg, B. Jonsson, H. Raffelt, Regular inference for state machines with parameters, in: FASE, 2006, pp. 107-121. (Pubitemid 44019305)
10. K.J. Lang, Random DFA's can be approximately learned from sparse uniform examples, in: COLT, 1992, pp. 45-52.
11. K.J. Lang, B.A. Pearlmutter, R.A. Price, Results of the abbadingo one DFA learning competition and a new evidence-driven state merging algorithm, in: ICGI, 1998, pp. 1-12. (Pubitemid 128108889)
12. J. Oncina, and P. Garcia Inferring regular languages in polynomial update time N. Pérez de la Blanca, A. Sanfeliu, E. Vidal, Pattern Recognition and Image Analysis Ser. Mach. Percept. Artif. Intell. vol. 1 1992 World Scientific 49 61
13. P. Dupont, Incremental regular inference, in: ICGI, 1996, pp. 222-237. (Pubitemid 126134598)
14. P. Dupont, B. Lambeau, C. Damas, and A. van Lamsweerde The qsm algorithm and its application to software behavior model induction Applied Artificial Intelligence 22 2008 77 115 (Pubitemid 351326196)
15. C. Câmpeanu, N. Santean, S. Yu, Minimal cover-automata for finite languages, in: Workshop on Implementing Automata, 1998, pp. 43-56.
16. C. Câmpeanu, N. Santean, and S. Yu Minimal cover-automata for finite languages Theoret. Comput. Sci. 267 1-2 2001 3 16 (Pubitemid 32866920)
17. C. Câmpeanu, A. Paun, and S. Yu An efficient algorithm for constructing minimal cover automata for finite languages Internat. J. Found. Comput. Sci. 13 1 2002 83 97
18. C. Câmpeanu, A. Paun, and J.R. Smith Incremental construction of minimal deterministic finite cover automata Theoret. Comput. Sci. 363 2 2006 135 148 (Pubitemid 44486530)
19. H. Körner, On minimizing cover automata for finite languages in o (nlog n) time, in: CIAA, 2002, pp. 117-127.
20. H. Körner A time and space efficient algorithm for minimizing cover automata for finite languages Internat. J. Found. Comput. Sci. 14 6 2003 1071 1086
21. n 2) algorithm for constructing minimal cover automata for finite languages, in: CIAA, 2000, pp. 243-251.
22. J.E. Hopcroft, R. Motwani, and J.D. Ullman Introduction to Automata Theory, Languages, and Computation 3rd edition 2006 Addison-Wesley Longman
23. J.L. Balcázar, J. Díaz, and J. Gabarró Uniform characterizations of non-uniform complexity measures Information and Control 67 1-3 1985 53 69 (Pubitemid 16576478)
24. C. Dwork, and L.J. Stockmeyer A time complexity gap for two-way probabilistic finite-state automata SIAM J. Comput. 19 6 1990 1011 1023
25. J. Shallit, and Y. Breitbart Automaticity I: Properties of a measure of descriptional complexity J. Comput. System Sci. 53 1 1996 10 25 (Pubitemid 126358872)
26. F. Ipate On the minimality of finite automata and stream x-machines for finite languages Comput. J. 48 2 2005 157 167 (Pubitemid 40414922)
27. A. Biere, A. Cimatti, E.M. Clarke, Y. Zhu, Symbolic model checking without BDDs, in: TACAS, 1999, pp. 193-207.
28. M.R. Prasad, A. Biere, and A. Gupta A survey of recent advances in sat-based formal verification Int. J. Software Tools Tech. Tran. 7 2 2005 156 173 (Pubitemid 41349074)
29. F. Ipate, Bounded sequence testing from non-deterministic finite state machines, in: TestCom, 2006, pp. 55-70. (Pubitemid 44044862)
30. F. Ipate Bounded sequence testing from deterministic finite state machines Theoret. Comput. Sci. 411 16-18 2010 1770 1784
31. A. Groce, D. Peled, M. Yannakakis, Adaptive model checking, in: TACAS, 2002, pp. 357-370.