Resource bounded next value and explanatory identification

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Resource bounded next value and explanatory identification: learning automata, patterns and polynomials on-line

Full text

Pdf (2.41 MB)

Source

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

Nashville, Tennessee, United States

Pages: 263 - 274

Year of Publication: 1997

ISBN:0-89791-891-6

Authors

Susanne Kaufmann	Interactive Systems Laboratories, Am Fasanengarten 5, Universität Karlsruhe, 76128 Karlsruhe, Germany
Frank Stephan	Mathematisches Institut, Im Neuenheimer Feld 294, Universität Heidelberg, 69120 Heidelberg, Germany

Sponsors

AT&T Labs :
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence
Vanderbilt University : Vanderbilt University

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 15, Downloads (12 Months): 26, Citation Count: 2

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/267460.267509 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	Dana Angluin (1980) : Finding patterns common to a set of strings. Journal of Computer and System Sciences 21:46-62.
	2	Dana Angluin, Learning regular sets from queries and counterexamples, Information and Computation, v.75 n.2, p.87-106, November 1, 1987 [doi>10.1016/0890-5401(87)90052-6]
	3	Dana Angluin , Carl H. Smith, Inductive Inference: Theory and Methods, ACM Computing Surveys (CSUR), v.15 n.3, p.237-269, Sept. 1983 [doi>10.1145/356914.356918]
	4	Janis Barzdins (1971): Prognostication of automata and functions. Information Processing '71 (1) 81-84. Edited by C. P. Freiman, North-Holland, Amsterdam.
	5	Janis Barzdins (1974): Two theorems on the limiting synthesis of functions. In: Theory of Algorithms and Programs, vol. 1, 82-88. Edited by Janis Barzdins, Latvian State University, Riga.
	6	Janis Barzdins and Rusins Freivalds (1972): On the prediction of general recursive functions. Soviet Math. Doklady 13:1224-1228.
	7	Janis Barzdins and Rusins Freivalds (1974): Prediction and limiting synthesis of effectively enumerable classes of functions. Theory of Algorithms and Programs, vol. 1, Latvia State University 101-111 (in Russian).
	8	Leonard Blum and Manuel Blum (1975): Towards a Mathematical Theory of Inductive Inference. Information and Control 28:125-155.
	9	John Case and Carl Smith (1983): Comparison of Identification Criteria for Machine Inductive Inference. Theoretical Computer Science 25:193-220.
	10	Rusins Freivalds , Janis Barzdins , Karlis Podnieks, Inductive Inference of Recursive Functions: Complexity Bounds, Baltic Computer Science, Selected Papers, p.111-155, January 1991
	11	Rūsiņš Freivalds , Efim Kinber , Carl H. Smith, On the impact of forgetting on learning machines, Proceedings of the sixth annual conference on Computational learning theory, p.165-174, July 26-28, 1993, Santa Cruz, California, United States [doi>10.1145/168304.168326]
	12	Mark Gold (1967): Language Identification in the Limit. Information and Control 10:447-474.
	13	Oscar H. Ibarra , Tao Jiang, Learning regular languages from counterexamples, Proceedings of the first annual workshop on Computational learning theory, p.371-385, August 03-05, 1988, MIT, Cambridge, Massachusetts, United States
	14	Efim B. Kinber, Monotonicity versus Efficiency for Learning Languages from Texts, Proceedings of the 4th International Workshop on Analogical and Inductive Inference: Algorithmic Learning Theory, p.395-406, October 10-15, 1994
	15	Efim Kinber , Frank Stephan, Language learning from texts: mindchanges, limited memory, and monotonicity, Information and Computation, v.123 n.2, p.224-241, Dec. 1995 [doi>10.1006/inco.1995.1170]
	16	Steffen Lange , Thomas Zeugmann, Language learning in dependence on the space of hypotheses, Proceedings of the sixth annual conference on Computational learning theory, p.127-136, July 26-28, 1993, Santa Cruz, California, United States [doi>10.1145/168304.168320]
	17	Nick Littlestone, Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm, Machine Learning, v.2 n.4, p.285-318, April 1988 [doi>10.1023/A:1022869011914]
	18	Nick Littlestone , Manfred K. Warmuth, The weighted majority algorithm, Information and Computation, v.108 n.2, p.212-261, Feb. 1, 1994 [doi>10.1006/inco.1994.1009]
	19	Hartley Rogers, Jr., Theory of recursive functions and effective computability, MIT Press, Cambridge, MA, 1987
	20	Piergiorgio Odifreddi (1989): Classical Recursion Theory. North-Holland.
	21	Daniel Osherson, Michael Stob and Scott Weinstein (1986): Systems that Learn. Bradford - The MIT Press, Cambridge, Massachusetts.
	22	Leonard Pitt , Carl H. Smith, Probability and plurality for aggregations of learning machines, Information and Computation, v.77 n.1, p.77-92, April 1988 [doi>10.1016/0890-5401(88)90046-6]
	23	Robert I. Soare, Recursively enumerable sets and degrees, Springer-Verlag New York, Inc., New York, NY, 1987
	24	L. G. Valiant, A theory of the learnable, Communications of the ACM, v.27 n.11, p.1134-1142, Nov. 1984 [doi>10.1145/1968.1972]
	25	V. G. Vovk, Universal forecasting algorithms, Information and Computation, v.96 n.2, p.245-277, Feb. 1992 [doi>10.1016/0890-5401(92)90050-P]
	26	Thomas Zeugmann (1993): Algorithmisches Lernen von Funktionen und Sprachen. Habilitationsschrift an der Technischen Hochschule Darmstadt.

CITED BY 2

	Sanjay Jain , Arun Sharma, On a generalized notion of mistake bounds, Proceedings of the twelfth annual conference on Computational learning theory, p.249-256, July 07-09, 1999, Santa Cruz, California, United States
	Steffen Lange , Thomas Zeugmann , Sandra Zilles, Learning indexed families of recursive languages from positive data: A survey, Theoretical Computer Science, v.397 n.1-3, p.194-232, May, 2008