Unit 1

1 Define Symbols, Alphabet and String with the help of example.

2 What is Cartesian Product of two set? Find the caresian product of Sets
A={x,y}, B={a, b}
3 State the definition of DFA/ NFA.
4 Identify the prefixes and suffixes of the string
(String/s will be given)
5 Construct DFA/NFA for the given language
6 Write the steps to construct Transition diagram
7 Convert NFA to DFA
8 Minimizing DFA (Pair table method)
9 Convert the NFA with ɛ-moves to its equivalent NFA without ɛ-moves.
(NFA will be given)
10 Construct a DFA over a symbol {0, 1} which accepts all strings divisible by
3/4/5. Write all the tuples of DFA. Draw Transition Table for the same.
11 Compare Deterministic Finite Automata and Non-deterministic Finite
Automata.
12 Explain Chomsky Hierarchy.

Unit 2

1 Write steps to convert Right Linear grammar to its equivalent grammar.

Convert the following right-linear grammar to its equivalent left-linear
grammar:
Or
Write steps to convert Left Linear grammar to its equivalent Right Linear
grammar. And conversion of the LLG to RLG.
(Production rules for grammar will be given)
2 Arden’s Theorem.
3 State the definition of Regular Expression. Using RE express the language
consisting of all strings over ∑ = {0, 1}
4 Finding Regular expression for the given language.
(Language will be given)
5 Draw an NFA with ε-moves for the regular expression (Regular Expression
will be given)
6 Create equivalent grammar for given Finite Automata:
(DFA will be given)
7 Convert Regular Grammar to its equivalent Finite Automata.
(Production rules for grammar will be given)
8 Check whether given grammar is ambiguous or not.
(Production rules for grammar will be given)
 9 Simplification of grammar
Removal of Unit Productions, Removal of Useless symbol, ɛ-Productions.
(Production rules for grammar will be given)

Unit 3

1 Can every regular language be accepted by Context-Free grammar (CFG)?

Justify with the example.
2 Prove CFL/ CFG is closed under concatenation property.
3 Describe types of derivation with the help of following example:
S  aAS | a
A SbA | SS | ba
Derive string ‘abab’ using leftmost and rightmost derivation.
4 Express the given grammar in CNF. (Production rules for grammar will be
given)
5 Express the given grammar in GNF. (Production rules for grammar will be
given)
6 Find the CFL associated with CFG. (Production rules for grammar will be
given)
7 Creation of PDA. (Language will be given)
8 Define Context Free grammar. Give example.
9 Prove CFL/ CFG is closed under Union property/ Kleen’s Closure.
10 Draw Derivation tree for given grammar.
11 Simplify the grammar by eliminating unit productions and ɛ-Productions.
(Production rules for grammar will be given)
12 Describe Chomsky Normal Form.
13 Simplify given Context-Free Grammar to its Context-Free Language.
(Production rules for grammar will be given)
14 Describe the working of Push Down Automata with the help of Diagram.
Demonstrate PUSH and POP operation works with PDA.
15 Construct a PDA, which accepts the language denoted by the following grammar:
S aSa | bSb | a | b | ε

Unit-4

1 Draw basic Turing machine model and enlist the elements of the model.
2 Define Turing recognizable (recursively enumerable) and Turing decidable
(recursive) languages.
3 State the formal definition of Turing Machine.
4 Consider the language L = {an bn cn | n>=1} which consists of strings with
equal numbers of aaa's, bbb's, and ccc's. Genrate Context Sensitive grammar
for given language. Also derive the string “aabbcc”.
5 Design a Turing Machine that recognizes words of the form {0n1n for n>= 0.}
6 Design a Turing Machine to find the 2’s Compliment of a given binary number.
 7 Design a Turing Machine that recognizes strings containing equal no of 0s and
1s.
8 Design a Turing machine that accepts the language L = {w | w is a
palindrome}.
9 Evaluate whether nondeterministic Turing machines are more powerful than
deterministic Turing machines. Justify your answer.
10 Differentiate recursive and recursively enumerable language.
11 Explain Context-sensitive grammars (CSG) with suitable example.
12 Explain Linear Bounded Automata and all the tuples in LBA with appropriate
example.
13 Construct a simple example of an unrestricted grammar and show how it can
be simulated by a Turing machine.
14 Compare and contrast the behavior of deterministic and nondeterministic
Turing machines. Under what conditions are they equivalent?

Unit-5

1 Express the definition of a universal Turing machine.

2 How does Rice’s Theorem relate to properties of languages and
undecidability?
3 What is the Church-Turing hypothesis?
4 Explain the working of Pushdown Automata.
5 Explain the different types of complexity classes.
6 Explain Rice’s Theorem. How does Rice’s Theorem relate to properties of
languages and undecidability?
7 Explain Post Correspondence Problem.
8 Compare between P and NP problems.
9 Does the Turing machine finish computing of the string w in a finite number
of steps? Demonstrate with Turing Machine Halting problem.
10 Explain Cook’s Theorem.
11 Explain Turing Machine Halting problem.
12 Prove Statement of Rice’s theorem- “Every non-trivial Property of an RE
Language is undecidable.”