Department of Computer Science and Engineering QUESTION BANK Subject Code /Title: CS2303 Theory of Computation Year / Sem:

III / V UNIT-I AUTOMATA PART-A(2-MARKS)

List any four ways of theorem proving. Define TOC Define Alphabets. Write short notes on Strings. What is induction principle? Give an example. What is Computation? Write down the applications of Theory of Computation. What is the need for finite automata? What is a finite automaton? Give two examples. Define DFA. Explain how DFA process strings. Define transition diagram. Define transition table. Define the language of DFA. Construct a finite automata that accepts {0,1}+. Give the DFA accepting the language over the alphabet 0,1 that have the set of all strings ending in 00. 17. Give the DFA accepting the language over the alphabet 0,1 that have the set of all strings with three consecutive 0s. 18. Give the DFA accepting the language over the alphabet 0,1 that have the set of all strings with 011 as a substring. 19. Give the DFA accepting the language over the alphabet 0,1 that have the set of all strings whose 10th symbol from the right end is 1. 20. Give the DFA accepting the language over the alphabet 0,1 that have the set of all strings such that each block of 5 consecutive symbol contains at least two 0s. 21. Give the DFA accepting the language over the alphabet 0,1 that have the set of all strings that either begins or end(or both) with 01. 22. Give the DFA accepting the language over the alphabet 0,1 that have the set of all strings such that the no of zeros is divisible by 5 and the no of 1s is divisible by 3. 21. Find the language accepted by the DFA given below. 22. Define NFA. 23. Define the language of NFA. 24. Is it true that the language accepted by any NFA is different from the regular language? Justify your Answer. 25. Define -NFA. 26. Define closure. 27. Define Set, Infinite and Finite Set. 28. Prove 1+2+3++n= n(n+1)/2 using induction method. 29. Write any three applications of Automata Theory. 30. Design FA to check whether given unary number is divisible by three. 31. Differentiate DFA and NFA? 32. Prove 1+2+3++n= n(n+1)/2 using induction method. 33. Give some examples for additional forms of proof. 34. Write any three applications of Automata Theory. 35. List the operations on languages. 36.Define graphs. 37.Define Kleene closure. 38.What is positive closure. 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16.

39. What is formal proof and inductive proof? 40.