AT PYQS

1. Differentiate between Moore machine and Mealy machine.

2. What do you mean by ambiguous grammar? Prove that the following grammar is
ambiguous.
S → aS/ aSbS/ε
3. Distinguish between NFA and DFA.
4. What is Halting problem? Explain with example.
5. What is a regular expression? Design DFA corresponding to the regular
¿ +¿ ¿
expression ( 0+1 ) 101 ( 0+1 )
6. Define the structure of Push Down Automata (PDA). Explain the power and
limitations of PDA.
7. Design PDA to accept language L={an b2 n∨n≥ 1 }
8. Define CFG. Design a CFG for the language L={0n 12 n∨n ≥ 0}
9. Find the leftmost derivation, rightmost derivation and parse trees for the string
aaabbabbba using CFG:
S → aB/bA A → aS /bAA/aB→ bS /aBB/b
10. Describe Chomsky Normal Form (CNF). Convert the following CFG to CNF
S → aAbB A → Ab/b B→ Ba/a
11. Explain Greibach Normal Form (GNF) Convert the following CFG to GNF
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
13. Design a TM to accept ¿). Can a DFA be designed for the same? Justify.
14. Write short notes on: Application of FA, CFG, PDA and TM
15. Write short notes on: Chomsky Hierarchy
16. Write short notes on: Right Linear and Left Linear Grammars
17. Write short notes on: Phases of Compiler
18. Write short notes on: Reduced DFA
(DEC 22)

1
1. Describe Moore machine with all tuples in detail.
2. Arrange a mealy machine to accept all strings ending with 00 or 11.
3. Design DFA to accept strings over the alphabet Σ={a , b } containing even number
of a ’s
4. Evaluate given context-free grammar and Identify whether it is ambiguous or not.
S → a|Sa| bSS|SSb|SbS
5. Draw diagram for Chomsky hierarchy and Show all the types with proper
explanation.
6. Design NFA for accepting input strings that contain either the keyword 000 or the
keyword 010 and convert it into an equivalent DFA
7. Design a DFA corresponding to regular expression
( a+ b )¿ aba ( a+b )¿
8. Design a Mealy machine that accepts strings ending in 00 and 11. Convert the
same to Moore Machine
9. Define CFG, obtain CFG for the following grammar
( 110+ 11)¿ ( 10 )¿
10. Construct a Turing machine accepting palindromes over Σ= { a ,b }
11. Design a PDA for L= { an bn|n ≥ 1 }
12. Design a Moore machine which counts the occurrence of substring bba in input
string.
13. Design a TM accepting the set of strings with equal number of 0’s and 1’s over
¿
{0 , 1}
14. Write short note on: Halting Problem in TM.
15. Explain applications of FM, PDA and Turing Machine with example.
(MAY 23)

2
1. Define the following terms and give an example of each: Automata, String,
Language, Alphabet, Grammar
2. What are the limitations of Finite Automata?
3. What do you mean by ambiguous grammar?
4. Design Turing Machine to add two unary numbers.
5. Describe the language of the following regular expressions as concisely as
possible
¿
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 )
6. Write down the regular expression for the following language.
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
7. Design Push Down Automata (PDA) for the language L= { an b a2 n|n ≥ 0 }
8. What do you mean by Deterministic Finite Automata (DFA)? Design DFA for the
language defined over Σ {0 , 1} and consists of the strings ending with 10.
9. 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.
10. What are Moore and Mealy machines. Design Moore and Mealy machines to
convert each occurrence of abb with aba
11. Convert the following grammar into Chomsky Normal Form (CNF)
S → a|aA|B A → aBB∨εB→ Aa∨b
12. Design a Turing Machine to accept the language
m m
L={a b :m ≥1 }
13. Write short notes on: Variants of TM
14. Write short notes on: Chomsky hierarchy
15. Write short notes on: Power and Limitations of PDA
16. Write short notes on: Halting Problem
17. Write short notes on: Regular Expressions
(DEC 23)

3
1. Describe Moore machine with all tuples in detail.
2. Find the Regular Expression corresponding to the grammar
S → AB/ AS A → a/aA B→ b
3. Construct mealy machine to accept all strings ending with 00 or 11.
4. Write a note on Universal Turing Machine.
5. Draw diagram for Chomsky hierarchy and Show all the types with proper
explanation.
6. Design NFA for accepting input strings that contain either the keyword 000 or the
keyword 010 and convert it into an equivalent DFA.
7. Design a DFA corresponding to regular expression
( a+ b )¿ aba ( a+b )¿
8. What are Moore and Mealy machines?
Design a Moore and Mealy machines to convert all occurrences of ‘1110’ to ‘1011’
over Σ {0 , 1}
¿ ¿
9. Define CFG, obtain CFG for the following grammar ( 110+ 11) ( 10 )
10. Construct a Turing machine accepting palindromes over Σ={a , b }
11. Discuss power and limitations of PDA. Compare it with FA and TM.
12. Define CFG.
Find the leftmost derivation, rightmost derivation and parse trees for the string
aaabbabbba using CFG:
S → aB/bA A → aS /bAA/aB→ bS /aBB/b
13. Construct NFA for Binary strings that begin with 11 and end with 11 or begin
with 00 and end with 00
14. Write short notes on: Halting Problem in TM
15. Write short notes on: Greibach Normal Form (GNF)
16. Write short notes on: Applications of FM, PDA and Turing Machine with
example
(MAY 24)

4
1. What do you mean by Right-Linear and Left-Linear grammars?
2. What is Finite Automata (FA)? List the limitations of FA.
3. Explain the need for normalization in grammars.
4. Design Turing machine to multiply two unary numbers.
5. Define the terms: Regular Expression, Regular Grammar and Regular Language.
6. Write down the regular expressions for the following language L:
a. For all string over {0 ,1 } having no consecutive 1s
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
7. What are Moore and Mealy machines. Design Moore and Mealy machines to
convert each occurrence of aaa with bbb
8. Design Push Down Automata (PDA) for the language
L= { a2 n b an|n ≥ 0 }
9. What do you mean by Deterministic Finite Automata (DFA)? Construct an
automaton for binary numbers divisible by 5 excluding numbers with leading
zeroes.
10. Consider the grammar S → aSa|bSb| SS∨λ
Given the string babbabaaba, find a leftmost and rightmost derivations with
corresponding parse trees.
11. What is a compiler? Explain the different phases of a compiler.
12. Convert the following grammar into Chomsky Normal Form (CNF)
S → aSa|bSb| A∨λ A → a|b| λ
13. Design a Turing machine over Σ {0 , 1} to accept the language
L= { 02 m 1m|m>0 }
14. Write short notes on: Non-Deterministic Finite Automata
15. Write short notes on: Power and Limitations of PDA
16. Write short notes on: Greibach Normal Form (GNF)
17. Write short notes on: Chomsky hierarchy
18. Write short notes on: Universal Turing Machine
(DEC 24)