125) Dynamic errors can be detected at

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