An Algebraic View on Exact Learning from Queries

  • Ricard Gavaldá
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3526)


Computational Learning Theory has two goals: one, proposing rigorous models of learning tasks that can be carried out by computers. Two, designing algorithms that provably learn whole classes of concepts in these models within some efficiency criterion.


  1. 1.
    Angluin, D.: Learning regular sets from queries and counterexamples. Information and Computation 75, 87–106 (1987)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Angluin, D.: Queries and concept learning. Machine Learning 2, 319–342 (1988)Google Scholar
  3. 3.
    Gavaldà, R., Thérien, D.: Learning expressions over monoids. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol. 2010, pp. 283–293. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  4. 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)Google Scholar
  5. 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)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Barrington, D.M., Straubing, H., Thérien, D.: Non-uniform automata over groups. Information and Computation 89, 109–132 (1990)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Gavaldà, R., Thérien, D.: Algebraic characterization of small classes of boolean functions. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol. 2607, pp. 331–342. Springer, Heidelberg (2003)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Ricard Gavaldá
    • 1
  1. 1.Department of Software (LSI)Universitat Politécnica de CatalunyaBarcelonaSpain

Personalised recommendations