Unit1 Assignment Questions

1. Minimize the given machine

2. Explain Mealy and moore machine with example.

3. Explain Myhill-Nerode method of minimization?
4. State and prove pumping lemma for regular set?
5. Construct finite automata to the following regular expression
(11+0)*(00+1)*01
Unit2 Assignment Questions
1.Explain rule for Simplification of Context free grammars.
2.Convert the following CFG to GNF
SAB|0
ABC|1
B CD|2
CAD|0
D1
3.Define
1) Chomsky Normal form
2) Greibach Normal form
4.Change the following grammer in to CNF
SabSb|a|aAb
AbS|aAAb
5. Explain Derivation tree,left most derivation and right most derivation.
Unit3 Assignment Questions

1. Construct PDA for the following set:

L={0n1n2n|n>=1}
2. Construct a PDA equivalent to the following grammer
SaAA
AaS|bS|a
3. State and prove pumping lemma for CFG.
4. Difference between deterministic PDA and non-deterministic PDA with
example.
5.What are the steps for Converting CFG to PDA?

Unit4 Assignment Questions

1. Define Turning Machine?Explain Turning thesis briefly.
2.Explain how turing machine can be used as generating device?
3. Construct turing machine for accepting LL={anbn|n>=0}
4.Types of turing machine?
5. Design a turing machine to recognize all strings consisting of even number of 1s.
Unit5. Assignment Questions
1. Explain Recursively Enumerable languages.
2.Explain the post correspondence problem.
3. What do you understand by P, NP, NP complete and NP hard problems.
4.Explain traveling sales man problem.
5.Discuss satisfy ability problems.Prove that satisfy ability is NP complete.