• Learning from positive and negative examples: New proof for binary alphabets 

      Lingg, Jonas; De Oliveira Oliveira, Mateus; Wolf, Petra Henrike Karola (Journal article; Peer reviewed, 2024)
      One of the most fundamental problems in computational learning theory is the problem of learning a finite automaton A consistent with a finite set P of positive examples and with a finite set N of negative examples. By ...