Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical 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
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-07-01 21:35 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
