Algorithmic Learning Theory
for ALT 2001 in
Theoretical Computer Science
Algorithmic Learning Theoryfor ALT 2001 in Theoretical Computer Science |
|
|
Theoretical Computer Science
Volume 313, Issue 2, February 2004.
The Special Issue on Algorithmic Learning Theory for ALT '01 has been edited by Naoki Abe and Roni Khardon. |
|
N. Abe and
R. Khardon.
Foreword, | pp. 173-174 |
|
|
|
|
Dana Angluin
Queries revisited, Abstract. | pp. 175-194 |
|
|
|
|
Yuri Kalnishkan,
Volodya Vovk,
and
Michael V. Vyugin
Loss functions, complexities, and the Legendre transformation, Abstract. | pp. 195-207 |
|
|
|
|
Sanjay Jain and
Frank Stephan
Learning how to separate, Abstract. | pp. 209-228 |
|
|
|
|
Sandra Zilles
Separation of uniform learning classes, Abstract. | pp. 229-265 |
|
|
|
|
François Denis,
Aurélien Lemay
and
Alain Terlutte
Learning regular languages using RFSAs, Abstract. | pp. 267-294 |
|
|
|
|
C. de la Higuera and
J. C. Janodet
Inference of ω-languages from prefixes, Abstract. | pp. 295-312 |
|
|
|
 back to the ALT
Archives page
|
