Theoretical Computer Science, Volume 397

Volume 397, Numbers 1-3, May 2008

• John Case, Takeshi Shinohara, Thomas Zeugmann, Sandra Zilles:
  Foreword. 1-3
  

• Thomas Zeugmann, Sandra Zilles:
  Learning recursive functions: A survey. 4-56
  
• Gunter Grieser:
  Reflective inductive inference of recursive functions. 57-69
  
• Rusins Freivalds, Richard F. Bonner:
  Quantum inductive inference by finite automata. 70-76
  
• Jan Poland:
  Nonstochastic bandits: Countable decision set, unbounded costs and reactive environments. 77-93
  
• Frank J. Balbach:
  Measuring teachability using variants of the teaching dimension. 94-113
  
• Sanjay Jain, Eric Martin, Frank Stephan:
  Absolute versus probabilistic classification in a logical setting. 114-128
  
• M. R. K. Krishna Rao:
  Some classes of term rewriting systems inferable from positive data. 129-149
  
• Yen Kaow Ng, Takeshi Shinohara:
  Developments from enquiries into the learnability of the pattern languages from positive data. 150-165
  
• Daniel Reidenbach:
  Discontinuities in pattern inference. 166-193
  
• Steffen Lange, Thomas Zeugmann, Sandra Zilles:
  Learning indexed families of recursive languages from positive data: A survey. 194-232
  
• Sanjay Jain, Efim B. Kinber:
  Learning and extending sublanguages. 233-246
  

Last update Tue May 21 19:44:38 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page