Learning Fallible Deterministic Finite Automata

Research output: Contribution to journalArticlepeer-review


We consider the problem of learning from a fallible expert that answers all queries about a concept, but often gives incorrect answers. The expert can also be thought of as a truth table describing the concept which has been partially corrupted. In order to learn the underlying concept with arbitrarily high precision, we would like to use its structure in order to correct most of the incorrect answers. We assume that the expert's errors are uniformly and independently distributed, occur with any fixed probability strictly smaller than 1/2, and are persistent. In particular, we present a polynomial time algorithm using membership queries for correcting and learning fallible Deterministic Finite Automata under the uniform distribution.

Original languageEnglish
Pages (from-to)149-185
Number of pages37
JournalMachine Learning
Issue number2
StatePublished - Feb 1995


  • Deterministic Finite Automata
  • Fallible Expert
  • PAC Learning under the Uniform Distribution
  • Persistent Errors


Dive into the research topics of 'Learning Fallible Deterministic Finite Automata'. Together they form a unique fingerprint.

Cite this