Learning from Positive and Negative Examples: New Proof for Binary Alphabets

Jonas Lingg, Mateus de Oliveira Oliveira, Petra Wolf

One of the most fundamental problems in computational learning theory is the the problem of learning a finite automaton $A$ consistent with a finite set $P$ of positive examples an…