Theoretical Computer Science, Volume 137

Volume 137, Number 1, 9 January 1995

Special Issue on Algorithmic Learning Theory, Selected Papers from ALT'93, Tokyo

Masami Hagiya:
A Typed lambda-Calculus for Proving-by-Example and Bottom-Up Generalization Procedure. 3-23
Electronic Edition (link) BibTeX
Klaus P. Jantke, Steffen Lange:
Case-Based Representation and Learning of Pattern Languages. 25-51
Electronic Edition (link) BibTeX
Yasuhito Mukouchi, Setsuo Arikawa:
Towards a Mathematical Theory of Machine Discovery from Facts. 53-84
Electronic Edition (link) BibTeX
Sanjay Jain, Arun Sharma:
On Aggregating Teams of Learning Machines. 85-108
Electronic Edition (link) BibTeX
Akito Sakurai:
On the VC-Dimension of Depth four Threshold Circuits and the Complexity of Boolean-Valued Functions. 109-127
Electronic Edition (link) BibTeX
Ayumi Shinohara:
Complexity of Computing Vapnik-Chervonenkis Dimension and Some Generalized Dimensions. 129-144
Electronic Edition (link) BibTeX
Susumu Hasegawa, Hiroshi Imai, Masaki Ishiguro:
epsilon-Approximations of k-Label Spaces. 145-157
Electronic Edition (link) BibTeX
Atsuyoshi Nakamura, Naoki Abe:
Exact Learning of Linear Combinations of Monotone Terms from Function Value Queries. 159-176
Electronic Edition (link) BibTeX

Henning Fernau:
Valuations of Languages, with Applications to Fractal Geometry. 177-217
Electronic Edition (link) BibTeX
Stéphane Fabre:
Substitutions et beta-systèmes de numération. 219-236
Electronic Edition (link) BibTeX
Zoltán Ésik, L. Bernátsky:
Equational Properties of Kleene Algebras of Relations with Conversion. 237-251
Electronic Edition (link) BibTeX
Atsushi Takahashi, Shuichi Ueno, Yoji Kajitani:
Mixed Searching and Proper-Path-Width. 253-268
Electronic Edition (link) BibTeX
Dany Breslauer:
Fast Parallel String Prefix-Matching. 269-278
Electronic Edition (link) BibTeX
Vikraman Arvind, Johannes Köbler, Uwe Schöning, Rainer Schuler:
If NP has Polynomial-Size Circuits, then MA=AM. 279-282
Electronic Edition (link) BibTeX