@inproceedings{10.1007/3-540-51734-0_50,
    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.},
    Address = {Berlin, Heidelberg},
    Author = {Pitt, Leonard},
    BookTitle = {Analogical and Inductive Inference},
    Editor = {Jantke, Klaus P.},
    File = {Inductive inference, DFAs, and computational complexity - pitt1989 - a.pdf},
    ISBN = {978-3-540-46798-4},
    Pages = {18--44},
    Publisher = {Springer Berlin Heidelberg},
    Title = {Inductive inference, DFAs, and computational complexity},
    Year = {1989},
    date-added = {2023-10-04 20:54:27 +0200},
    date-modified = {2023-10-04 20:54:27 +0200},
    doi = {10.1007/3-540-51734-0_50}
}

@inproceedings{10.1007/3-540-51734-0_50, 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.}, Address = {Berlin, Heidelberg}, Author = {Pitt, Leonard}, BookTitle = {Analogical and Inductive Inference}, Editor = {Jantke, Klaus P.}, File = {Inductive inference, DFAs, and computational complexity - pitt1989 - a.pdf}, ISBN = {978-3-540-46798-4}, Pages = {18--44}, Publisher = {Springer Berlin Heidelberg}, Title = {Inductive inference, DFAs, and computational complexity}, Year = {1989}, date-added = {2023-10-04 20:54:27 +0200}, date-modified = {2023-10-04 20:54:27 +0200}, doi = {10.1007/3-540-51734-0_50} }