Results of the Abbadingo One DFA Learning Competition and a New Evidence-Driven State Merging Algorithm (1998)

by Kevin Lang , Barak Pearlmutter , Rodney Price
Citations:96 - 1 self

Documents Related by Co-Citation

104 Inferring regular languages in polynomial update time, chapter – José Oncina, Pedro Garćıa - 1992
69 Random DFA's can be Approximately Learned from Sparse Uniform Examples – Kevin Lang - 1992
513 Learning Regular Sets from Queries and Counterexamples – Dana Angluin - 1987
903 Language identification in the limit – E M Gold - 1967
3890 J.D.: Introduction to Automata Theory, Languages and Computation, 2nd edn – J E Hopcroft, R Motwani, Ullman - 2001
1718 A Theory of the Learnable – L. G. Valiant - 1984
562 Generalization as search – Tom M Mitchell - 1982
551 Dynamically discovering likely program invariants to support program evolution – M D Ernst, J Cockrell, W G Griswold, D Notkin - 2001
544 A Sense of Self for Unix Processes – Stephanie Forrest, Steven A. Hofmeyr, Anil Somayaji, Thomas A. Longstaff - 1996