Consider the language L given by the regular expression (a+b)*b(a+b) over the alphabet {a,b}. The smallest number of states needed in deterministic finite-state automation (DFA) accepting […]
Question 26 The number of states in the minimum sized DFA that accepts the language defined by the regular expression (0+1)*(0+1)(0+1)*is_________. A 2 B 3 C […]
Question 1 Prove by the principal of mathematical induction that for any binary tree, in which every non-leaf node has 2 descendants, the number of leaves […]