in Theory of Computation edited by
332 views
1 vote
1 vote
Find a NFA that accepts the complement of the language (ab*aa + bba*ab)
in Theory of Computation edited by
332 views

1 Answer

2 votes
2 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

2 Comments

I see.

Thank you.
0
0
To do complement, just change all final state to non-final state and Non-final state to final state. This works only on DFA. as you have constructed NFA your answer is wrong.
1
1

Related questions