Inductive Inference, DFAs and Computational Complexity (1989)
by
Leonard Pitt
| Venue: | 2nd Int. Workshop on Analogical and Inductive Inference (AII |
| Citations: | 73 - 1 self |
BibTeX
@INPROCEEDINGS{Pitt89inductiveinference,,
author = {Leonard Pitt},
title = {Inductive Inference, DFAs and Computational Complexity},
booktitle = {2nd Int. Workshop on Analogical and Inductive Inference (AII},
year = {1989},
pages = {18--44}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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. 1
