Check the following (true/false)

Question

Check the following statements:-

Suppose we created an automaton to accept a language L.

1. we can make its complement by making final state to non-final & vice-versa. (T/F)

2. we can make the reverse of L by reversing arrows & making initial state to final & final state to initial state. (T/F)

Comments

It's TT for DFA and FF for NFA.

Answer 1

Both statements are true, but only for DFA.

For NFA, both statements are false.

Therefore, for an automata in general, both statements are false.