Team EasyExamNotes 
RGPV 2020 Show that the following grammar is ambiguous. S → aSbS|bSaS|∈ Ans. For grammar to be ambiguous, there should be more than one parse … Read more
RGPV 2020 What are leftmost and rightmost derivations? Explain with suitable example ? Grammar: S → aS / ∈ For generating strings ‘aaa’. Left … Read more
RGPV 2020Construct Moore machine for the following Mealy machine. Sol. Transition table for above Mealy machine. Present State Next State Input = 0 Input = … Read more
RGPV 2020 Preve that CFL are not closed under intersection ? If L1 and If L2 are two context free languages, their intersection L1 … Read more
1. The postfix expression AB + CD – * can be evaluated using a
(A) Stack
(B) Tree
(C) Queue
(D) Linked list
Answer: (A)
RGPV 2007 Q. Define deterministic finite automta. Draw DFA that accepts any string which ends with 1 or it ends with an even number of … Read more
RGPV 2009 Q. Construct minimized DFA for the given NFA. Or Convert the following NFA into DFA. Ans. Transition table for given NFA State Input … Read more
RGPV 2009Construct a Mealy mcahine which is equivalent to the Moore mchine given below. Present State Next State Output a = 0 a = 1 … Read more
RGPV 2011Design FA which accepts even no. of 0’s and even no. of 1’s.Or RGPV 2010Construct DFA ove input alphabet Σ = {0,1} to accept string … Read more
RGPV 2010Q. Write short note on automata ? Ans. An automaton is an abstract model of a digital computer. Some types of automata : Finite-state … Read more