Inductive inference, DFAs, and computational complexity

Leonard Pitt

Research output: Chapter in Book/Report/Conference proceedingConference contribution


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.

Original languageEnglish (US)
Title of host publicationAnalogical and Inductive Inference - International Workshop, All 1989, Proceedings
EditorsKlaus P. Jantke
Number of pages27
ISBN (Print)9783540517344
StatePublished - 1989
Event2nd International Workshop on Analogical and Inductive Inference, AII 1989 - Reinhardsbrunn Castle, Germany
Duration: Oct 1 1989Oct 6 1989

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume397 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other2nd International Workshop on Analogical and Inductive Inference, AII 1989
CityReinhardsbrunn Castle

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Inductive inference, DFAs, and computational complexity'. Together they form a unique fingerprint.

Cite this