Journal of the ACM Bibliography

Selected papers that cite this one

• Yoav Freund, Michael Kearns, Dana Ron, Ronitt Rubinfeld, Robert E. Schapire, and Linda Sellie. Efficient learning of typical finite automata from random walks. Information and Computation, 138(1):23-48, 10 October 1997.

• Ronald L. Rivest and Robert E. Schapire. Inference of finite automata using homing sequences. Information and Computation, 103(2):299-347, April 1993.

Selected references

• Dana Angluin. On the complexity of minimum inference of regular sets. Information and Control, 39(3):337-350, December 1978.

• Dana Angluin. Inference of reversible languages. Journal of the ACM, 29(3):741-765, July 1982.

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

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

• E. Mark Gold. Complexity of automaton identification from given data. Information and Control, 37(3):302-320, June 1978.

• Michael Kearns and Leslie Valiant. Cryptographic limitations on learning Boolean formulae and finite automata. Journal of the ACM, 41(1):67-95, January 1994.

• Leonard Pitt and Manfred K. Warmuth. The minimum consistent DFA problem cannot be approximated within any polynomial. Journal of the ACM, 40(1):95-142, January 1993.

• Ronald L. Rivest and Robert E. Schapire. Inference of finite automata using homing sequences (extended abstract). In Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, pages 411-420, Seattle, Washington, 15-17 May 1989.

• Robert Endre Tarjan. Efficiency of a good but not linear set union algorithm. Journal of the ACM, 22(2):215-225, April 1975.

Shortcuts: