Results of the abbadingo one DFA learning competition and a new evidence-driven state merging algorithm

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1433, Issue , 1998, Pages 1-12

  Lang, Kevin J ^a   Pearlmutter, Barak A ^b   Price, Rodney A ^c  

^a NEC LABORATORIES AMERICA   (United States)

^b University of New Mexico   (United States)

^c Emtex   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

EVIDENCE DRIVEN STATE MERGING ALGORITHMS; TRAINING DATA;

COMPUTATIONAL GRAMMARS;

EID: 84947908042     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0054059     Document Type: Conference Paper

References (12)

1. B. Trakhtenbrot and Ya. Barzdin'. (1973) Finite Automata: Behavior and Synthesis. North-Holland Publishing Company, Amsterdam.
2. D. Angluin. (1978) On the Complexity of Minimum Inference of Regular Sets. Information and Control, Vol. 39, pp. 337-350.
3. L. Veelenturf. (1978) Inference of Sequential Machines from Sample Computations. IEEE Transactions on Computers, Vol. 27, pp. 167-170.
4. M. Kearns and L. Valiant. (1989) Cryptographic Limitations on Learning Boolean Formulae and Finite Automata. STOC-89.
5. L. Pitt and M. Warmuth. (1989) The Minimum DFA Consistency Problem Cannot be Approximated Within any Polynomial. STOC-89.
6. Kevin J. Lang. Random DFA's can be Approximately Learned from Sparse Uniform Examples. In Proceedings of the Fifth Annual ACM Workshop on Computational Learning Theory, pp 45-52, July 1992.
7. J. Oncina and P. Garcia. Inferring Regular Languages in Polynomial Updated Time. In Pattern Recognition and Image Analysis. pp. 49-61, World Scientific, 1992.
8. Yoav Freund, Michael Kearns, Dana Ron, Ronitt Rubinfeld, Robert Schapire, and Linda Sellie. Efficient Learning of Typical Finite Automata from Random Walks, STOC-93, pp. 315-324.
9. P. Dupont, L. Miclet, and E. Vidal. What is the search space of the regular inference? In Proceedings of the International Colloquium on Grammatical Inference ICGA-94, Lecture Notes in Artificial Intelligence 862, pp. 25-37, Springer-Verlag, 1994.
10. C. de la Higuera, J. Oncina, and E. Vidal. Identification of DFA: Data-Dependent Versus Data-Independent Algorithms. In Proceedings of the International Colloquium on Grammatical Inference ICGA-96 Lecture Notes in Artificial Intelligence 1147, pp. 313-325, Springer-Verlag, 1996.
11. Joe Kilian and Kevin J. Lang. (1997) A Scheme for Secure Pass-Fail Tests. NECI Technical Note 97-016N.
12. Hugues Juillé and Jordan B. Pollack. (1998) SAGE: a Sampling-based Heuristic for Tree Search. Submitted to Machine Learning.