A comparative study of two algorithms for automata identification

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

Volumn 1891, Issue , 2000, Pages 115-126

  Garcia P ^a   Cano, A ^a   Ruiz, J ^a  

^a UNIVERSITAT POLITÈCNICA DE VALÈNCIA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GRAMMARS; TREES (MATHEMATICS);

COMPARATIVE STUDIES; PREFIX TREES;

INFERENCE ENGINES;

EID: 33745351550     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45257-7_10     Document Type: Conference Paper

References (6)

1. García, P. Cano, A. and Ruiz, J. Estudio comparativo de dos algoritmos de identificación de autómatas. Internal Report DSIC-II/1/00 Univ. Politécnica Valencia. (2000) (In Spanish).
2. Gold, M. Complexity of Automaton Identification from Given Data. Information and Control 37, pp 302-320 (1978).
3. Hopcroft, J. and Ullman, J. Introduction to Automata Theory, Languages and Computation. Addison-Wesley (1979).
4. Lang, K.J. 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. (1992).
5. Oncina, J. and García, P. Inferring Regular Languages in Polynomial Updated Time. In Pattern Recognition and Image Analysys. Pérez de la Blanca, Sanfeliú and Vidal (Eds.) World Scientific. (1992).
6. Trakhtenbrot B. and Barzdin Ya. Finite Automata: Behavior and Synthesis. North Holland Publishing Company. (1973).