UNIT-1

1. Define DFA. Explain with an example.

2. Define NDFA. Explain with an example.
3. Construct DFA for given string (or) Convert the given English text into DFA
4. Explain NFA with and without € moves.
5. Convert given NFA to DFA.
6. Convert NFA with € moves to NFA without € moves.
7. Convert given moore machine into mealy machine
8. Convert given mealy machine into moore machine
9. Distinguish between DFA and NFA.

UNIT-2

1. Define RE and give applications of RE.

2. Explain about algebraic laws of regular expressions.
3. Convert FA to RE.
4. Convert RE to FA.
5. Define Pumping Lemma and give applications of pumping lemma.
6. Show that the given language is not regular
For ex:
Show that the language L={wwR} is not regular.
Show that the language L={0i1i} is not regular.
Show that the language L={anbn} is not regular.
7. Explain about closure properties of regular languages.
8. Construct the minimum state finite automata for given FA (or) minimize the given FA
(minimization of automata using marking method).

UNIT-3

1. Define CFG with an example and give applications of CFG.

2. Define CFG. Explain about LMD (Left Most Derivation) and RMD (Right Most Derivation) of a
CFG.
3. Prove that the given language or grammar is ambiguous.
4. Define PDA. Explain about PDA acceptance by Final state and empty stack.
5. Design PDA for the given language. (ex: L={wwR} or L={anbn}
6. Convert given CFG to PDA
7. Convert given PDA to CFG

UNIT-4

1. Explain about elimination of € (null) productions for given CFG.

2. Explain about elimination of useless production for given CFG.
3. Explain about elimination of unit- productions for given CFG.
4. Explain about CNF (Chomsky Normal Form)
5. Explain about GNF (Griebach Normal Form)
6. Convert CFG to CNF
7. Convert CFG to GNF
8. Explain about closure properties of CFL
9. Define Turing Machine.
10. Design or Construct the Turning Machine for given Language (ex. L={wcwR} or L={anbn}
11. Check whether given language or String accepted by Turing Machine or not.

UNIT-5

1. Explain about different types of Turing Machines.

2. Explain about Decidability and Undecidability
3. What is PCP (Post Correspondence Problem) give an example.
4. Check whether PCP has solution for given problem.