4 citations · 20 across the 28 of their papers we have counts for
1 paper · 2 filters
Lukáš Holík, Ondřej Lengál, Juraj Síč +2
We investigate means of efficient computation of the simulation relation over symbolic finite automata (SFAs), i.e., finite automata with transitions labeled by predicates over alp…