Question

Reverse of a DFA can be formed by

(a) using PDA

(b) making final state as non-final

(c) making final as starting state and starting state as final state

(d) None of the mentioned

I got this question in an interview for job.

This key question is from Union, Intersection & Complement topic in division Finite Automata of Automata Theory

Answer 1

Right option is (c) making final as starting state and starting state as final state

To elaborate: By making final state as starting state string starting from end will be accepted.