46 citations · 112 across the 6 of their papers we have counts for
1 paper · 1 filter
Vladimir Ulyantsev, Ilya Zakirzyanov, Anatoly Shalyto
It was shown before that the NP-hard problem of deterministic finite automata (DFA) identification can be effectively translated to Boolean satisfiability (SAT). Modern SAT-solvers…