IDS: An Incremental Learning Algorithm for Finite Automata

E. M. Gold, “Language identification in the limit,” Information and Control , vol. 10, pp. 447–474, 1967

1967

Earlier work this paper cites.

J. E. Hopcroft and R. M. Karp, “A linear algorithm for testing equivalence of finite automata,” Cornell University, Tech. Rep. TR 71-114, 1971. [Online]. Available: http://hdl.handle.net/1813/5958

Original

1971

Earlier work this paper cites.

D. Angluin, “A note on the number of queries needed to identify regular languages,” Information and Control , vol. 51, no. 1, pp. 76–87, October 1981

1981

Earlier work this paper cites.

D. Angluin, “Learning regular sets from queries and counterexamples,” Information and Computation , vol. 75, no. 1, pp. 87–106, November 1987

1987

Earlier work this paper cites.

S. Porat and J. A. Feldman, “Learning automata from ordered examples,” Mach. Learn. , vol. 7, pp. 109–138, September 1991. [Online]. Available: http://portal.acm.org/citation.cfm?id=125342.125343

1991

Earlier work this paper cites.

P. Oncina, J.; García, Inferring regular languages in polynomial update time . World Scientific Publishing, 1991, ch. -

1991

Earlier work this paper cites.

K. J. Lang, “Random dfa’s can be approximately learned from sparse uniform examples,” in Proceedings of the fifth annual workshop on Computational learning theory , ser. COLT ’92. New York, NY, USA: ACM, 1992, pp. 45–52. [Online]. Available: http://doi.acm.org/10.1145/130385.130390

1992

Cited alongside, same era.

P. Dupont, “Incremental regular inference,” in Proceedings of the Third ICGI-96 , ser. LNAI, no. 1147, 1996

1996

Cited alongside, same era.

R. Parekh, C. Nichitiu, and V. Honavar, “A polynomial time incremental algorithm for regular grammar inference,” in Proc. Fourth Int. Colloq. on Grammatical Inference (ICGI 98) , ser. LNAI. Springer, 1998

1998

Cited alongside, same era.

D. Peled, M. Vardi, and M. Yannakakis, “Black-box checking,” in Formal Methods for Protocol Engineering and Distributed Systems FORTE/PSTV . Kluwer, 1999, pp. 225–240

1999

Cited alongside, same era.

M. Luecker, “Learning meets verification,” in FMCO , ser. Lecture Notes in Computer Science, F. S. de Boer et al., Ed., vol. 4709. Springer, 2006, pp. 127–151

2006

Later among the works it cites.

H. Raffelt, B. Steffen, and T. Margaria, “Dynamic testing via automata learning,” in Hardware and Software: Verification and Testing , ser. LNCS, no. 4899. Springer, 2008, pp. 136–152

2008

Later among the works it cites.

T. Bohlin and B. Jonsson, “Regular inference for communication protocol entities,” Dept. of Information Technology, Uppsala University, Technical Report 2008-024, 2008

2008

Later among the works it cites.

K. Meinke and F. Niu, “A learning-based approach to unit testing of numerical software,” in Proc. Twenty Second IFIP Int. Conf. on Testing Software and Systems (ICTSS 2010) , ser. LNCS, no. 6435. Springer, 2010, pp. 221–235

2010

Later among the works it cites.