April 5, 2025
Question 73 Consider the regular expression R = (a + b)* (aa + bb) (a + b)* Which one of the regular expressions given below defines […]
April 5, 2025
Question 29 A minimum state deterministic finite automaton accepting the language L = {w | w ε {0,1} *, number of 0s and 1s in w […]
April 5, 2025
Question 6 Let N be an NFA with n states and let M be the minimized DFA with m states recognizing the same language. Which of […]
April 5, 2025
Question 1 Palindromes can’t be recognized by any Finite State Automata because A FSA cannot remember arbitrarily large amount of information B FSA cannot deterministically fix […]