Learning behaviors of automata from shortest counterexamples

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

Volumn 904, Issue , 1995, Pages 380-391

  Bergadano, F ^a   Varricchio, S ^b  

^a UNIVERSITY OF MESSINA   (Italy)

^b UNIVERSITY OF L'AQUILA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION;

EQUIVALENCE QUERIES; LEARNING BEHAVIOR; POLYNOMIAL-TIME ALGORITHMS;

COMPUTATION THEORY;

EID: 84955576672     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-59119-2_193     Document Type: Conference Paper

References (9)

1. D. Angluin. A note on the number of queries needed to identify regular languages. Information and Control, 51:76-87, 1981.
2. D. Angluin. Learning regular sets from queries and counterexamples. Information and Computation, 75:87-106, 1987.
3. D. Angluin. Negative results for equivalence queries. Machine Learning, 5:121-150, 1990.
4. F. Bergadano and S. Varricchio. Learning Behaviors of Automata from Equivalence and Multiplicity Queries (Extended Abstract), Lecture Notes in Computer Science, Vol. 778, pages 54-62, 1994.
5. F. Bergadano and S. Varricchio. Learning Behaviors of Automata from Equivalence and Multiplicity Queries. SIAM Journal on Computing, to appear.
6. J. Berstel and C. Reutenauer. Rational series and their languages. Springer-Verlag, Berlin, 1988.
7. S. Eilenberg Automata, Languages and Machines. Vol. A, Academic Press, New York, 1974.
8. O. Ibarra and T. Jiang. Learning regular languages from counterexamples Proc of 1988 Workshop on Computational Learning Theory, 5: 371-385 1988.
9. A. Salomaa and M. Soittola. Automata theoretic aspects of formal power series. Springer-Verlag, New York, 1978.