Theory of Computation–S.Y.B.Sc.–C.S.–Semester–III
Theory of Computation–S.Y.B.Sc.–C.S.–Semester–III
Contents
1. Automata Theory
2. Formal Languages
3. Regular Sets and Regular Grammar
4. Context Free Languages
5. Pushdown Automata
6. Turing Machines and Linear Bounded Automata
7. Undecidability
Model Question Paper (Set – I)
Model Question Paper (Set – II)
| Exam | S.Y.B.SC.Computer Science |
|---|