AT PYQS

1. Differentiate between Moore machine and Mealy machine. [DEC 22]

2. What do you mean by ambiguous grammar? [DEC 22/DEC 23]
Prove that the following grammar is ambiguous. [DEC 22]
S → aS/ aSbS/ε
3. Distinguish between NFA and DFA [DEC 22]
4. What is Halting problem? Explain with example. [DEC 22]
Write short note on: Halting Problem in TM [MAY 23/MAY 24]
Write short note on: Halting Problem [DEC 23]
5. What is a regular expression? [DEC 22
Write short notes on: Regular Expressions [DEC 23]
Define the terms: Regular Expression, Regular Grammar and Regular Language.
[DEC 24]
¿ +¿ ¿
Design DFA corresponding to the regular expression ( 0+1 ) 101 ( 0+1 ) [DEC 22]
6. Define the structure of Push Down Automata (PDA). Explain the power and
limitations of PDA. [DEC 22]
Write short notes on: Power and Limitations of PDA [DEC 23/DEC 24]
7. Design PDA to accept language L= { an b2 n|n ≥ 1 } [DEC 22]
8. Define CFG. [DEC 22/MAY 23/MAY 24]
Design a CFG for the language L= { 0n 12 n|n ≥ 0 } [DEC 22]
Obtain CFG for the following grammar [MAY 23/MAY 24]
( 110+ 11)¿ ( 10 )¿
9. Find the leftmost derivation, rightmost derivation and parse trees for the string
aaabbabbba using CFG: [DEC 22/MAY 24]
S → aB/bA A → aS /bAA/aB→ bS /aBB/b
10. Describe Chomsky Normal Form (CNF). [DEC 22]
Convert the following CFG to CNF [DEC 22]
S → aAbB A → Ab/b B→ Ba/aConvert the following grammar into Chomsky Normal
Form (CNF) [DEC 23]
S → a|aA|B A → aBB∨εB→ Aa∨b Convert the following grammar into Chomsky Normal
Form (CNF) [DEC 24]
S → aSa|bSb| A∨λ A → a|b| λ

1
 11. Explain Greibach Normal Form (GNF) [DEC 22]
Write short notes on: Greibach Normal Form (GNF) [MAY 24/DEC 24]
Convert the following CFG to GNF [DEC 22]
S → XY X → 0 X /1 Y /1Y →1
12. What is a Turing Machine (TM)? Explain the working of TM with a neat sketch.
Also describe the variants of TM [DEC 22]
Write short notes on: Variants of TM [DEC 23]
13. Design a TM to accept ¿). Can a DFA be designed for the same? Justify. [DEC
22]
14. Write short notes on: Application of FA, CFG, PDA and TM [DEC 22]
Explain applications of FM, PDA and Turing Machine with example. [MAY 23]
Write short notes on: Applications of FM, PDA and Turing Machine with example.
[MAY 24]
15. Write short notes on: Chomsky Hierarchy [DEC 22/DEC 23/DEC 24]
Draw diagram for Chomsky hierarchy and Show all the types with proper
explanation. [MAY 23/MAY 24]
16. Write short notes on: Right Linear and Left Linear Grammars [DEC 22]
What do you mean by Right-Linear and Left-Linear grammars? [DEC 24]
17. Write short notes on: Phases of Compiler [DEC 22]
What is a compiler? Explain the different phases of a compiler. [DEC 24]
18. Write short notes on: Reduced DFA [DEC 22]
19. Describe Moore machine with all tuples in detail. [MAY 23/MAY 24]
20. Arrange a mealy machine to accept all strings ending with 00 or 11. [MAY 23]
Design a Mealy machine that accepts strings ending in 00 and 11. Convert the
same to Moore Machine [MAY 23]
Construct mealy machine to accept all strings ending with 00 or 11. [MAY 24]
21. Design DFA to accept strings over the alphabet Σ={a , b } containing even
number of a ’s [MAY 23]
22. Evaluate given context-free grammar and Identify whether it is ambiguous or
not. [MAY 23]
S → a|Sa| bSS|SSb|SbS
23. Design NFA for accepting input strings that contain either the keyword 000 or
the keyword 010 and convert it into an equivalent DFA [MAY 23/MAY 24]
24. Design a DFA corresponding to regular expression [MAY 23/MAY 24]
( a+ b )¿ aba ( a+b )¿
25. Construct a Turing machine accepting palindromes over Σ= { a ,b } [MAY 23/MAY
24]
26. Design a PDA for L= { an bn|n ≥ 1 } [MAY 23]
27. Design a Moore machine which counts the occurrence of substring bba in input
string. [MAY 23]
28. Design a TM accepting the set of strings with equal number of 0’s and 1’s over
¿
{0 , 1} [MAY 23]
29. Define the following terms and give an example of each: Automata, String,
Language, Alphabet, Grammar [DEC 23]

2
30. What is Finite Automata (FA)? [DEC 24]
What are the limitations of Finite Automata? [DEC 23/DEC 24]
31. Design Turing Machine to add two unary numbers. [DEC 23]
32. Describe the language of the following regular expressions as concisely as
possible [DEC 23]
¿
a. 1 ( 0+1 ) 0
¿ ¿
b. ( aa ) ( bb ) (b)
¿
c. ( ab+ ba )
¿
d. ( A−Z ) ( a−z ) (a+ e+i+o +u)
¿
e. ( a−z )( a−z|0−9 )
33. Write down the regular expression for the following language. [DEC 23]
a. L is a language for all strings over {0 ,1 } having an odd number of 1s and
any number of 0s.
b. L is language for all strings over {0 ,1 } having number of 10 or 11
34. Design Push Down Automata (PDA) for the language [DEC 23] L= { an b a2 n|n ≥ 0 }
35. What do you mean by Deterministic Finite Automata (DFA)? [DEC 23/DEC 24]
Design DFA for the language defined over Σ {0 , 1} and consists of the strings
ending with 10. [DEC 23]
Construct an automaton for binary numbers divisible by 5 excluding numbers with
leading zeroes. [DEC 24]
36. Consider the grammar S → 0 S 0|1 S 1| SS∨λ .
Given the string 0101101110 , find a leftmost and rightmost derivations with
corresponding parse trees. [DEC 23]
Consider the grammar S → aSa|bSb| SS∨λ
Given the string babbabaaba, find a leftmost and rightmost derivations with
corresponding parse trees [DEC 24]
37. What are Moore and Mealy machines. [DEC 23/MAY 24/DEC 24]
Design Moore and Mealy machines to convert each occurrence of abb with aba
[DEC 23]
Design a Moore and Mealy machines to convert all occurrences of ‘1110’ to ‘1011’
over Σ {0 , 1} [MAY 24]
Design Moore and Mealy machines to convert each occurrence of aaa with bbb
[DEC 24]
38. Design a Turing Machine to accept the language [DEC 23]
m m
L={a b :m ≥1 }
39. Find the Regular Expression corresponding to the grammar [MAY 24]
S → AB/ AS A → a/aA B→ b
40. Write short notes on Universal Turing Machine. [MAY 24/DEC 24]
41. Discuss power and limitations of PDA. Compare it with FA and TM. [MAY 24]
42. Construct NFA for Binary strings that begin with 11 and end with 11 or begin
with 00 and end with 00 [MAY 24]
43. Explain the need for normalization in grammars. [DEC 24]
44. Design Turing machine to multiply two unary numbers. [DEC 24]
45. Write down the regular expressions for the following language L: [DEC 24]
a. For all string over {0 ,1 } having no consecutive 1s
3
 b. For all string over {0 ,1 } containing the sequence 011
c. For all string over {0 ,1 } whose length is a multiple of 3
d. For all string over {0 ,1 } containing no more than two 0s
46. Design Push Down Automata (PDA) for the language [DEC 24]
L= { a2 n b an|n ≥ 0 }
47. Design a Turing machine over Σ {0 , 1} to accept the language [DEC 24]
L= { 02 m 1m|m>0 }
48. Write short notes on: Non-Deterministic Finite Automata [DEC 24]