Beyond EDSM

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 2484, Issue , 2002, Pages 37-48

  Cicchello, Orlando ^a   Kremer, Stefan C ^a  

^a UNIVERSITY OF GUELPH   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GRAMMARS; INFERENCE ENGINES;

EVIDENCE DRIVEN STATE MERGING; INDUCTION ALGORITHMS; NEGATIVE EXAMPLES; PREFIX TREES;

ALGORITHMS;

EID: 84943240309     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/3-540-45790-9_4     Document Type: Conference Paper

References (10)

1. J. E. Hopcroft and J. D. Ullman, Formal Languages And Their Relation to Automata. Reading, Mass.: Addison-Wesley, 1969.
2. E. Gold Complexity of automaton identification from given data, Information and Control, vol. 37, pp. 302-320, 1978.
3. A. Blumer, A. Ehrenfeucht, D. Haussler, and M. K. Warmuth Occam's razor, Information Processing Letters, vol. 24, pp. 377-380, 1987.
4. B. A. Trakhtenbrot and Y. M. Barzdin, Finite Automata. Amsterdam: North-Holland, 1973.
5. K. J. Lang Random DFA's can be approximately learned from sparse uniform examples, Proceedings of the Fifth ACM Workshop on Computational Learning Theory, (New York, N. Y.), pp. 45-52, ACM, 1992.
6. K. J. Lang, B. A. Pearlmutter, and R. A. Price Results of the Abbadingo one DFA learning competition and a new evidence-driven state merging algorithm, Proc. 4th International Colloquium on Grammatical Inference-ICGI '98, vol. 1433, pp. 1-12, Springer-Verlag, 1998.
7. H. Juille and J. B. Pollack A sampling-based heuristic for tree search applied to grammar induction, Proceedings of the Fifteenth National Conference on Artificial Intelligence (AAAI-98) Tenth Conference on Innovative Applications of Artificial Intelligence (IAAI-98), (Madison, Wisconsin, USA), AAAI Press Books, 26-30 1998.
8. K. Lang Evidence-driven state merging with search, 1998.
9. A. L. Oliveira and J. P. M. Silva Efficient search techniques for the inference of minimum size finite automata, String Processing and Information Retrieval, pp. 81-89, 1998.
10. J. M. Pena and A. L. Oliveira A new algorithm for the reduction of incompletely specified finite state machines, Proc. of the ACM/IEEE International Conference on Computer Aided Design, (San Jose), pp. 482-489, IEEE Computer Society Press, 1998.