0 votes 0 votes Find a dfa that accepts the complement of the language defined by the nfa in figure: Theory of Computation peter-linz peter-linz-edition4 theory-of-computation finite-automata + – Naveen Kumar 3 asked Mar 22, 2019 Naveen Kumar 3 1.3k views answer comment Share Follow See 1 comment See all 1 1 comment reply Gurdeep Saini commented Mar 23, 2019 reply Follow Share the complement of the language defined by the NFA and complement of NFA both are a different thing here the language accepted by NFA is $aaa+(aa)^{+}$ now the complement of language is $epsilon+a+aaa(aa)^{+}$ 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes 7 state is required abhishekmehta4u answered Mar 25, 2019 • edited Mar 25, 2019 by abhishekmehta4u abhishekmehta4u comment Share Follow See all 0 reply Please log in or register to add a comment.