3 votes 3 votes in reversal of DFA if there are more than one final states then which one will be made the initial state? a DFA can have only one initial state Theory of Computation theory-of-computation finite-automata minimal-state-automata + – aditi19 asked Dec 10, 2018 aditi19 2.3k views answer comment Share Follow See all 7 Comments See all 7 7 Comments reply Show 4 previous comments aditi19 commented Dec 10, 2018 reply Follow Share yes.. ,my doubt got cleared... thanks :) 1 more doubt complement of DFA is always DFA right 1 votes 1 votes parabol commented Dec 10, 2018 reply Follow Share It depends on your method of complementation, the most common method is to change all final states into non-final states and vice versa. If you follow that method , you will get a 'DFA' for the complement of that particular language. This is not true with NFA , if you apply the above method on an NFA, result will be an 'NFA' ,but it might not be the complement of original language. 1 votes 1 votes gauravkc commented Dec 10, 2018 reply Follow Share Regular languages are closed under complement. So yes. 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes In dfa reversal , we reverse the arrow and make initial to final and final to initial state. if more than one final state we have then take epsilon transition from all final and make single initial state. _sonu answered Jan 28, 2019 _sonu comment Share Follow See 1 comment See all 1 1 comment reply vishnu777 commented Oct 19, 2022 reply Follow Share Can you provide an example for this case?? 0 votes 0 votes Please log in or register to add a comment.