Comparing the query complexity of active learning algorithms for deterministic finite automata