Question 12 Which of the following regular expressions represent(s) the set of all binary numbers that are divisible by three? Assume that the string ∊ is […]
Question 3 Draw the state transition of a deterministic finite state automaton which accepts all strings from the alphabet {a,b}, such that no string has 3 […]
Question 3 Pick the correct statements The logic of Pumping lemma is a good example of A the Pigeon-hole principle B the divide and conquer technique […]