This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
D. Angluin. A note on the number of queries needed to identify regular languages. Information and Control, 51(1):76–87, October 1981.
D. Angluin. Inference of reversible languages. Journal of the Association of Computing Machinery, 29(3):741–765, July 1982.
D. Angluin. Learning regular sets from queries and counterexamples. Information and Computation, 75(2):87–106, November 1987.
D. Angluin. Queries and concept learning. Machine Learning, 2: 319–342, 1988.
D. Angluin. Negative results for equivalence queries. Machine Learning, 5: 121–150, 1990.
D. Angluin. Computational learning theory: Survey and selected bibliography. In Proceedings of the 24th Annual ACM Symposium on the Theory of Computing, pages 351–369, New York, New York, 1992. ACM Press.
D. Angluin, M. Frazier, and L. Pitt. Learning conjunctions of horn clauses. In Proceedings of the 31st Annual Symposium on Foundations of Computer Science, pages 186–192. IEEE Computer Society Press, Los Alamitos, California, 1990.
D. Angluin and C. H. Smith. Inductive inference: Theory and methods. Computing Surveys, 15(3):237–269, September 1983.
P. Fischer. Lernalgorithmen für Bildbeschreibungssprachen. Master's thesis, Institut für Informatik, Universität Freiburg, March 1993.
J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages and Computation. Addison-Wesley Series in Computer Science. Addison-Wesley Publishing Company, Reading, MA, 1979.
H. A. Maurer, G. Rozenberg, and E. Welzl. Using string languages to describe picture languages. Information and Control, 54: 155–185, 1992.
E. F. Moore. Gedanken-experiments on sequential machines. In C. E. Shannon and J. McCarthy, editors, Automata Studies, pages 129–153. Princeton University Press, Princeton, New Jersey, 1956.
L. Pitt. Inductive inference, DFAs, and computational complexity. Technical report UIUCDSCS-R-89-1530, Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, Illinois, July 1989.
Y. Sakakibara. Learning context-free grammars from structural data in polynomial time. Theoretical Computer Science, 76: 223–242, 1990.
T. Shinohara. Polynomial time inference of extended regular pattern languages. In E. Goto, K. Furukawa, R. Nakajima, I. Nakata, and A. Yonezawa, editors, RIMS Symposia on Software Science and Engineering, pages 115–127, Berlin, 1983. Springer-Verlag. Lecture Notes in Computer Science 147.
L. G. Valiant. A theory of the learnable. Communications of the ACM, 27(11):1134–1142, November 1984.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Brüggemann-Klein, A., Fischer, P., Ottmann, T. (1994). Learning picture sets from examples. In: Karhumäki, J., Maurer, H., Rozenberg, G. (eds) Results and Trends in Theoretical Computer Science. Lecture Notes in Computer Science, vol 812. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58131-6_36
Download citation
DOI: https://doi.org/10.1007/3-540-58131-6_36
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58131-4
Online ISBN: 978-3-540-48445-5
eBook Packages: Springer Book Archive