October 23, 2023
Question 20 Minimum number of states required in DFA accepting binary strings not ending in “101” is A 3 B 4 C 5 D 6 Theory-of-ComputationFinite-AutomataVideo-Explanation […]
October 25, 2023
Question 1 A language L satisfies the Pumping Lemma for regular languages, and also the Pumping Lemma for context-free languages. Which of the following statements about […]
October 25, 2023
Question 2 In a pumping Lemma for regular languages, to say a language is satisfying pumping lemma, what is the minimum length of ‘y’ if you […]
October 26, 2023
Question 6 Which of the following statement is true? A mealy and moore machine are language acceptors B Finite state automata is language translator C NPDA […]