# Designing a DFA and the reverse of it

There is a theorem that says if a language is regular, its reverse is regular as well. How can I draw a DFA that shows if a language is regular, it's regular as well?

• I'm assuming by reverse, you mean its complement. Just change every accepting state in a DFA to rejecting, and every rejecting to accepting. – Daniil Agashiyev Feb 21 '15 at 17:02
• What do you mean by a DFA which does all the things itself? – babou Feb 22 '15 at 10:49

$$L^R$$ is the reverse of the language $$L$$ and for designing $$L^R$$ you must: