Learning DFAs from Positive Examples Only via Word Counting

Benjamin Bordais, Daniel Neider

Learning finite automata from positive examples has recently gained attention as a powerful approach for understanding, explaining, analyzing, and verifying black-box systems. The…