Skip to main content
Conference Proceedings

Inductive inference, DFAs, and computational complexity

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1989) 397 LNAI 18-44
DOI: 10.1007/3-540-51734-0_50
167Citations
Citations of this article
49Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper surveys recent results concerning the inference of deterministic finite automata (DFAs). The results discussed determine the extent to which DFAs can be feasibly inferred, and highlight a number of interesting approaches in computational learning theory.

Cite

CITATION STYLE

APA

Pitt, L. (1989). Inductive inference, DFAs, and computational complexity. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 397 LNAI, pp. 18–44). Springer Verlag. https://doi.org/10.1007/3-540-51734-0_50

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free