Journal of the ACM Bibliography

Selected papers that cite this one

• John Case, Susanne Kaufmann, Efim Kinber, and Martin Kummer. Learning recursive functions from approximations. Journal of Computer and System Sciences, 55(1):183-196, August 1997.

• Lance Fortnow, R\=usi\c{n}\v{s} Freivalds, William I. Gasarch, Martin Kummer, Stuart A. Kurtz, Carl H. Smith, and Frank Stephan. On the relative sizes of learnable sets. Theoretical Computer Science, 197(1-2):139-156, 15 May 1998.

• Martin Kummer and Frank Stephan. On the structure of degrees of inferability. Journal of Computer and System Sciences, 52(2):214-238, April 1996.

• Frank Stephan. Learning via queries and oracles. Annals of Pure and Applied Logic, 94(1-3):273-296, 5 October 1998.

Selected references

• Dana Angluin. Learning regular sets from queries and counterexamples. Information and Computation, 75(2):87-106, November 1987.

• Piotr Berman and Robert Roos. Learning one-counter languages in polynomial time (extended abstract). In 28th Annual Symposium on Foundations of Computer Science, pages 61-67, Los Angeles, California, 12-14 October 1987. IEEE.

• Lenore Blum and Manuel Blum. Toward a mathematical theory of inductive inference. Information and Control, 28(2):125-155, June 1975.

• Robert P. Daley and Carl H. Smith. On the complexity of inductive inference. Information and Control, 69(1-3):12-40, April/May/June 1986.

• R\=usi\c{n}\v{s} Freivalds, Carl H. Smith, and Mahendran Velauthapillai. Trade-off among parameters effecting inductive inference. Information and Computation, 82(3):323-349, September 1989.

• E. Mark Gold. Language identification in the limit. Information and Control, 10(5):447-474, May 1967.

• Michael Kearns, Ming Li, and Leslie Valiant. Learning Boolean formulas. Journal of the ACM, 41(6):1298-1328, November 1994.

• Robert McNaughton. Testing and generating infinite sequences by a finite automaton. Information and Control, 9(5):521-530, October 1966.

• B. K. Natarajan. On learning Boolean functions. In Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, pages 296-304, New York City, 25-27 May 1987.

• Shmuel Safra. On the complexity of omega-automata. In 29th Annual Symposium on Foundations of Computer Science, pages 319-327, White Plains, New York, 24-26 October 1988. IEEE.

• Carl H. Smith. The power of pluralism for automatic program synthesis. Journal of the ACM, 29(4):1144-1165, October 1982.

Shortcuts: