Extensional set learning (extended abstract)

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Extensional set learning (extended abstract)

Full text

Pdf (686 KB)

Source

Annual Workshop on Computational Learning Theory archive
Proceedings of the twelfth annual conference on Computational learning theory table of contents

Santa Cruz, California, United States

Pages: 243 - 248

Year of Publication: 1999

ISBN:1-58113-167-4

Author

Sebastiaan A. Terwijn

Mathematisches Institut, Ludwig-Maximilians-Universität München, Theresienstraβe 39, D-80333 München, Germany

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence
Univ. of California, : University of California at Santa Cruz

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 10, Citation Count: 1

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/307400.307448 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	D. Angluin, Inductive inference of formal languages from positive data, Information and Control 45 (1980) 117-135.
	2	Ganesh R. Baliga , John Case , Sanjay Jain, Synthesizing enumeration techniques for language learning, Proceedings of the ninth annual conference on Computational learning theory, p.169-180, June 28-July 01, 1996, Desenzano del Garda, Italy [doi>10.1145/238061.238090]
	3	J.M. Barzdin, Two theorems on the limiting synthesis of functions, Latv. Gos. Univ. UEe. Zap. 210 (1974) 82-88.
	4	John Case , Christopher Lynes, Machine Inductive Inference and Language Identification, Proceedings of the 9th Colloquium on Automata, Languages and Programming, p.107-115, July 12-16, 1982
	5	J. Case and C. Smith, Comparison of identification criteria for machine inductive inference, Theoretical Computer Science 25 (1983) 193-220.
	6	J. Feldman, Some decidability results on grammatical inference and complexity, Information and Control 20 (1972) 244-262.
	7	L. Fortnow, W. Gasarch, S. Jain, E. Kinber, M. Kummer, S. Kurtz, M. Pleszkoch, T. Slaman, R. Solovay, F. Stephan, Extremes in the degrees of inferability, Annals of Pure and Applied Logic 66 (1994) 231-276.
	8	Mark A. Fulk, Prudence and other conditions on formal language learning, Information and Computation, v.85 n.1, p.1-11, March 1990 [doi>10.1016/0890-5401(90)90042-G]
	9	Dick de Jongh , Makoto Kanazawa, Angluin's theorem for indexed families of r.e. sets and applications, Proceedings of the ninth annual conference on Computational learning theory, p.193-204, June 28-July 01, 1996, Desenzano del Garda, Italy [doi>10.1145/238061.238095]
	10	Martin Kummer , Frank Stephan, On the structure of degrees of inferability, Journal of Computer and System Sciences, v.52 n.2, p.214-238, April 1996 [doi>10.1006/jcss.1996.0018]
	11	Stuart A. Kurtz , James S. Royer, Prudence in language learning, Proceedings of the first annual workshop on Computational learning theory, p.206-219, August 03-05, 1988, MIT, Cambridge, Massachusetts, United States
	12	Tatsuya Motoki , Takeshi Shinohara , Keith Wright, The correct definition of finite elasticity: corrigendum to identification of unions, Proceedings of the fourth annual workshop on Computational learning theory, p.375, August 05-07, 1991, Santa Cruz, California, United States
	13	Piergiorgio Odifreddi, Inductive inference of total functions, Computability, enumerability, unsolvability: directions in recursion theory, Cambridge University Press, New York, NY, 1996
	14	OshersonandWeinstein, Criteriaoflanguagelearning, Information and Control 52 (1982) 123-138.
	15	Osherson, Stob, and Weinstein., Systems that learn, Bradfort- The MIT Press, Cambridge, Massachusetts, 1986.
	16	William I. Gasarch , Mark G. Pleszkoch, Learning via queries to an oracle, Proceedings of the second annual workshop on Computational learning theory, p.214-229, December 1989, Santa Cruz, California, United States
	17	Theodore A. Slaman , Robert Solovay, When oracles do not help, Proceedings of the fourth annual workshop on Computational learning theory, p.379-383, August 05-07, 1991, Santa Cruz, California, United States
	18	Robert I. Soare, Recursively enumerable sets and degrees, Springer-Verlag New York, Inc., New York, NY, 1987
	19	Keith Wright, Identification of unions of languages drawn from an identifiable class, Proceedings of the second annual workshop on Computational learning theory, p.328-333, December 1989, Santa Cruz, California, United States