Uncountable Automatic Classes and Learning
暂无分享,去创建一个
[1] Achim Blumensath,et al. Finite Presentations of Infinite Structures: Automata and Interpretations , 2004, Theory of Computing Systems.
[2] J. Büchi. Weak Second‐Order Arithmetic and Finite Automata , 1960 .
[3] Anil Nerode,et al. Automata theory and its applications , 2001 .
[4] Moshe Y. Vardi. The Büchi Complementation Saga , 2007, STACS.
[5] E. Mark Gold,et al. Language Identification in the Limit , 1967, Inf. Control..
[6] Dana Angluin,et al. Inductive Inference of Formal Languages from Positive Data , 1980, Inf. Control..
[7] J. R. Büchi. On a Decision Method in Restricted Second Order Arithmetic , 1990 .
[8] Lawrence S. Moss,et al. Review of "Automata theory and its applications" by Bakhadyr Khoussainov and Anil Nerode. Birkhäuser Boston, Inc. 2001.: and "Automata, logics, and infinite games" by E.Grädel, W. Thomas, and T. Wilke. Springer-Verlag. , 2004, SIGA.
[9] John Case,et al. The Power of Vacillation in Language Learning , 1999, SIAM J. Comput..
[10] Daniel N. Osherson,et al. Systems That Learn: An Introduction to Learning Theory for Cognitive and Computer Scientists , 1990 .
[11] Sanjay Jain,et al. Learnability of Automatic Classes , 2010, LATA.
[12] Anil Nerode,et al. Automatic Presentations of Structures , 1994, LCC.
[13] Achim Blumensath,et al. Automatic structures , 2000, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332).