40 citations · 142 across the 19 of their papers we have counts for
1 paper · 1 filter
Damien Pous
We first propose algorithms for checking language equivalence of finite automata over a large alphabet. We use symbolic automata, where the transition function is compactly represe…