Recursive languages are:

Let $${R_1}$$ and $${R_2}$$ be regular sets defined over the alphabet $$\sum \, $$ then:

State whether the following statement is TRUE / FALSE.

A minimal $$DFA$$ that is equivalent to an $$NFDA$$ with $$n$$ modes has always 2ⁿ states

State whether the following statement is TRUE / FALSE.

Regularity is preserved under the operation of string reversal.