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:89 - 1 self

Documents Related by Co-Citation

102 Inferring Regular Languages in Polynomial Update Time – J Oncina, P Garcia - 1992
67 Random DFA's can be Approximately Learned from Sparse Uniform Examples – Kevin Lang - 1992
504 Learning Regular Sets from Queries and Counterexamples – D Angluin - 1987
218 Complexity of automaton identification from given data – E M Gold - 1978
11 Efficient Search Techniques for the Inference of Minimum Size Finite Automata – Arlindo L. Oliveira, Joao P. Marques-Silva - 1998
73 J.A.: On the synthesis of finite-state machines from samples of their behavior – A W Biermann, Feldman - 1972
888 Language identification in the limit – E M Gold - 1967
3824 Introduction to Automata Theory, Languages, and Computation – J E Hopcroft, J D Ullman - 1979
43 Characteristic sets for polynomial grammatical inference – C de la Higuera - 1997
80 Finite Automata, Behavior and Synthesis – M Barzdin - 1973
45 What is the Search Space of the Regular Inference? – P. Dupont, L. Miclet, E. Vidal - 1994
15 Speeding up the synthesis of programs from traces – A W Biermann, R I Baum, F E Petry - 1975
99 Learning Subsequential Transducers for Pattern Recognition Interpretation Tasks – Jose Oncina, Pedro Garcia, Enrique Vidal - 1993
8 Evidence–driven state merging with search – K J Lang - 1998
303 Cryptographic Limitations on Learning Boolean Formulae and Finite Automata – Michael Kearns, Leslie Valiant - 1989
136 Learning Stochastic Regular Grammars by Means of a State Merging Method – Rafael C. Carrasco, Jose Oncina - 1994
8 Complexity of automaton identi from given data – E M Gold - 1978
112 Probability Inequalities for Sums of Bounded Random Variables – H Hoe¤ding - 1963
11 On the learnability and usage of acyclic probabilistic automata – D Ron, Y Singer, N Tishby - 1995