126) If a and b be the regular expressions, then( a* ∪ b* ) * is equivalent to

127) Finite state machines _________ recognize palindromes

128) If S and T be language over Σ= {a, b } represented by regular expression (a+ b * ) * and (a + b) * , respectively, then

129) Consider regular expression (0 + 1) (0 + 1) ....... n times. Minimum state finite automaton that recognizes the language represented by this regular expression contains

130) If regular set A is represented by A = (01 + 1)*and the regular set'B' is represented byB= ((01)*1*)*, then