DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

SECOND SERIES TEST – OCTOBER-2018 10. Explain Chomsky classification of languages and grammers

SUBJECT: CS 301 THEORY OF COMPUTATION

Time: 1 ½ hours Max. Marks: 50

PART- A
Answer all Questions

1. List closure properties of regular language (2 marks) 11. Explain steps to Myhill-Nerode theorem and use it to minimize the
2. Define regular expression and rules of regular expression(3 marks) following DFA
3. Construct a mealy machine of 1’s complement (3marks)

4. How many states you need for designing DFA ends with ‘00’.
(3marks)
5. Write ε-closure of each state with an example (3marks)
6. What is state transition diagram? (3 marks)

PART- B
Answer any four Questions (4 * 9=36 marks)

7. a)What is automata theory and significance of automata theory

b) What are the classifications of finite automation
8. State and explain pumping lemma and the application
9. Design a DFA a)starts with ‘ab’ b)ends with ‘ab’
Scrutinized by,

Name of the HoD

HoD (department):