Andreas Böker

Learn More
We show that deterministic finite automata (DFAs) with n states and input alphabet C can efficiently be learned from less than ICln2 smallest counterexamples. This improves on an earlier result of Ibarra and Jiang who required ICln3 smallest counterexamples. We show furthermore, that the special DFAs operating on input words of an arbitrary but fixed length(More)
  • 1