Examine the following DFA: If input is 011100101, which edge is NOT traversed?
(a) A B
(b) C
(c) C D
(d) D A
This question was addressed to me in an interview.
My enquiry is from The NFA with n-moves to the DFA topic in portion Finite Automata and Regular Expression of Compiler