Reverse and Complement of a Reg lang represented by DFA

Question

A regular lang is represented by a DFA. To find the reverse of the lang, we do the following:

                                  Change directions of arrows of state transitions and also interchange final <-> non-final states.

A regular lang is represented by a DFA. To find the complement of the lang, we do the following:

                                 Only interchange final <-> non-final states but arrows of state transition are kept same.

Am I correct? 

Now in case of reverse, previous final state would be new start state after reversing. So if there were two final states before then after reversing should both the states be "start state"?

Answer 1

Yes, you are right about that, but I would suggest that you please follow a much more logical approach toward these kind of questions, don't memorize those tricks, instead keep this thing in mind:- 
say for example a language is in the form, L={ aⁿbⁿ ; n $\leq$ 1}

Reversal:- L={ bⁿaⁿ ; n $\leq$ 1} (Just reverse the strings in the given language OR L^R)

Complement :- treat the given Language such that , it can accept anything except what condition is specified in the language, therefore It can accept everything except {ab, aabb, aaabbb...}that is, it can't accept equal number of a's and b's in a string.

(Or simply L^C = $\sum$ ^* - L)

 If you still want a direct answer using tricks only, you can refer :- https://www.youtube.com/watch?v=em-lZgQeDlI
Hope this Helps :)

Comments

Thanks:)