Question 2 Design a deterministic finite state automaton (using minimum number of states) that recognizes the following language: L = {w ∈ {0,1}* | w interpreted […]

Question 4 Let M = {K,Σ,δ,s,F} be a finite state automaton, where K = {A,B}, Σ = {a,b}, s = A, F = {B}, δ(A,a) = […]

Question 3 Which one of the following regular expressions correctly represents the language of the finite automaton given below? A ab*bab* + ba*aba* B (ab*b)*ab* + […]

Question 11 Which of the following are undecidable? P1: The language generated by some CFG contains any words of length less than some given number n. […]