2 votes 2 votes Find a NFA that accepts the complement of the language (ab*aa + bba*ab) Theory of Computation peter-linz theory-of-computation regular-expression + – ankit-saha asked Mar 26, 2022 • edited Mar 27, 2022 by ankit-saha ankit-saha 1.2k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
3 votes 3 votes To do complement, just change all final state to non-final state and Non-final state to final state. No after finding complemented DFA there is no need to change any thing to convert into NFA, because DFA is already satisfy property of NFA. For more details- computer science - Convert from DFA to NFA - Mathematics Stack Exchange amitraj123 answered Mar 27, 2022 amitraj123 comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments Silver_Reaper commented Feb 4, 2023 reply Follow Share @aaaakash001 Since there are no epsilon/lambda transition or any symbol getting repeated at a state we can consider this NFA to be a DFA. 0 votes 0 votes aaaakash001 commented Feb 4, 2023 reply Follow Share Some inputs are missing from states So, not DFA 1 votes 1 votes Praveen Saini commented Feb 4, 2023 reply Follow Share @Silver_Reaper You need to add one more state (trap state) to make is a dfa, then only you can take the complement. 0 votes 0 votes Please log in or register to add a comment.
