10 citations · 15 across the 9 of their papers we have counts for
1 paper · 2 filters
Dana Angluin, Dana Fisman
A regular language is almost fully characterized by its right congruence relation. Indeed, a regular language can always be recognized by a DFA isomorphic to the automaton correspo…