## CS6503 TOC Important Questions

Anna University Regulation 2013 CSE CS6503 TOC Important Questions for all 5 units are provided below. Download link for CSE 5th SEM CS6503 Theory of Computation Answer Key is listed down for students to make perfect utilization and score maximum marks with our study materials.

### UNIT I FINITE AUTOMATA

#### PART-A

1. Define finite automata.

2. Write the difference between the + closure and * closure.

3. Define alphabet, string, powers of an alphabet and concatenation of strings.

4. Define language and Grammar give an example.

5. What is a transition table and transition graph?

6. Give the DFA accepting the language over the alphabet 0, 1 that has the set of all strings beginning with 101.

7. 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.

8. Define NFA.

9. Difference between DFA and NFA.

10. Write the notations of DFA.

11. Define ε-NFA.

12. Define the language of NFA.

13. Is it true that the language accepted by any NFA is different from the regular language? Justify your Answer.

14. Define Regular Expression.

15. List the operators of Regular Expressions

16. State pumping lemma for regular languages

17. Construct a finite automaton for the regular expression 0*1*.

18. List out the applications of the pumping lemma.

19. Define Epsilon –Closures.

20. State minimization of DFA.

#### PART-B

1. a. What are the closure properties of CFL? State the proof for any two properties. b. Construct a CFG representing the set of palindromes over (0+1)*.

2. a. if G is the grammar S ÆSbS | a show that G is ambiguous. b. Let G= (V,T, P,S) be a CFG. If the recursive inference procedure tells that terminal string w is in the language of variable A, then there is a parse tree with root A and yield w.

3. Discuss in detail about ambiguous grammar and removing ambiguity from grammar.

4. Discuss about eliminating useless symbols with example.

5. Explain about eliminating € productions with example.

6. What is a unit production and how will you eliminate it. Give example.

7. Prove that if G is a CFG whose language contains at least one string other than €, then there is a grammar G1 in Chomsky Normal Form such that L)G1) = L(G) –{€}.

If you require any other notes/study materials, you can comment in the below section.

#### Search Terms

Anna University 5th SEM CSE TOC Important Questions