Publisher
Springer Berlin Heidelberg
Reference7 articles.
1. Angluin, D.: Learning regular sets from queries and counterexamples. Information and Computation 75, 87–106 (1987)
2. Angluin, D.: Queries and concept learning. Machine Learning 2, 319–342 (1988)
3. Lecture Notes in Computer Science;R. Gavaldà,2001
4. Gavaldà, R., Thérien, D., Tesson, P.: Learning expressions and programs over monoids. Technical Report R01–38, Departament LSI, Universitat Politecnica de Catalunya (2001) (Submitted to journal)
5. Barrington, D.: Bounded-width polynomial-size branching programs recognize exactly those languages in NC1. Journal of Computer and System Sciences 38, 150–164 (1989)