In: Computer Science
1.True or False:
a)If a language L is recognized by a 2^n-state DFA, then it must be recognized by some NFA with no more than n states.
b)For every three regular expressions R, S, and T, the languages denoted by R(S∪T) and (RS)∪(RT) are the same.
Please explain.