CS8501 TC Question Papers

Anna University Regulation 2017 CSE CS8501 TC Question Papers for previous years are provided below. Previous Year Question Papers for CSE 5th SEM CS8501 Theory of Computation, Engineering are listed down for students to make perfect utilization and score maximum marks with our study materials.

### Anna University Regulation 2017 (CSE) 5th SEM CS8501 TC – Theory of Computation question paper

1. Differentiate between DFA and NFA.
2. List the operators of Regular Expressions
3. Define inductive proof.
4. Identify NFA- ε to represent a*b | c
5. Differentiate between regular expression and regular language
6. Tabulate the regular expression for the following L1=set of strings 0 and 1 ending in 00, L2=set of all strings 0 and 1 beginning with 0 and ending with 1
7. Describe what is non-deterministic finite automata and the applications of automata theory.
8. Illustrate a regular expression for the set of all strings of 0’s and 1’s not containing 101 as substring.
9. What are the closure properties of regular languages?
10. Describe an identifier with a transition diagram (automata).

11. Define ε-NFA
12. Summarize minimization of DFA
13. Give the non-deterministic automata to accept strings containing the substring 0101
14. Illustrate if L be a set accepted by an NFA then there exists a DFA that accepts L.
15. Explaina finite automaton for the regular expression 0*1*.
16. Summarize the extended transition function for a ε-NFA
17. Develop a pumping lemma for regular set and what are the applications of pumping Lemma

18. Explain L={0n12n/n>=1}is not regular
19. Illustrate a regular expression for the set of all the strings have odd number of 1’s
20. Compose the difference between the + closure and * closure

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

#### Search Terms

CS8501 TC question papers

Anna University 5th SEM CSE TC Question Papers with answers