FLAT (5TH B.

TECH)
POSSIBLE IMPORTANT SHORT QUESTIONS

1. What is Finite State Machine? What are the elements of FSM?

2. Difference between Mealy machine & Moore machine.
3. Define Kleene Closure of a language.
4. What do you mean by epsilon closure of a state?
5. What is the difference between CFG and CSG?
6. Difference between CNF & GNF.
7. State Church-Turing hypothesis.
8. What is dead state? Give an example.
9. Differentiate between DFA & PDA.
10. When do you say that a Turing machine accepts a string?
11. When do you say that a language accepted by a PDA?
12. Give examples of an un-decidable problem.
13. What is halting problem of Turing machine.
14. Differentiate between NPDA & DPDA.
15. Differentiate between P and NP class.
16. What do you mean by LMD & RMD? Give example.
17. Define Recursive language & Recursive enumerable language.
18. Formal definition of (DFA, NFA, Mealy & Moore Machine, CFG, PDA, LBA, TM )
19. Construction or design of DFA.
20. Write regular expressions for given languages.
21. Show that one given CFG is ambiguous or not.
22. PCP & MPCP examples
23. Ackerman Function problems.

POSSIBLE IMPORTANT LONG QUESTIONS

1. DFA minimization (Traditional & Table filling method) [* Compulsory Question *]

2. €-NFA to DFA conversion.
3. Mealy to Moore & vice-versa conversion.[Try to remember one example to write from
own]
4. Write RE from given FA.
5. Design DFA from RE.
6. Pumping lemma for Regular language & context free language.
7. Simplification of CFG.
8. Find equivalent CNF or GNF. [* Compulsory Question *]
9. CYK or Membership algorithm. [* Compulsory Question *]
10. Construction of PDA [Important is anbn and WWR * Compulsory Question * ]
11. CFG to PDA & vice-versa [* Compulsory Question *]
12. Design of TM. [Important is anbncn , Comparator and WWR * Compulsory Question * ]
13. Types of TM
14. Universal TM
15. Chomsky Hierarchy of language. [* Compulsory Question *]