Theory of Automata and Formal Languages (BCS402) AKTU syllabus – unit-wise topics
The complete Theory of Automata and Formal Languages syllabus for AKTU, unit by unit. Next to each topic you can see how often it has appeared in past papers, so you know where the marks are.
Unit 1: Basic Concepts and Automata Theory
- Introduction to Theory of Computation – asked 4 times
- Deterministic Finite Automaton – asked 8 times
- Non Deterministic Finite Automaton – asked 10 times
- Finite Automata with Output – asked 1 times
- Minimization of Finite Automata – asked 8 times
Unit 2: Regular Expressions and Languages
- Regular Expressions – asked 7 times
- Arden's Theorem – asked 7 times
- Closure Properties of Regular Languages – asked 6 times
- Pumping Lemma for Regular Languages – asked 7 times
- Decidability of Regular Languages – asked 1 times
Unit 3: Regular and Non-Regular Grammars
- Context Free Grammar – asked 17 times
- Regular Grammars – asked 2 times
- FA and Regular Grammar Conversion – asked 2 times
- Simplification of CFG – asked 2 times
- Normal Forms of CFG – asked 5 times
- Chomsky Hierarchy – asked 3 times
Unit 4: Push Down Automata and Properties of Context Free Languages
- Nondeterministic Pushdown Automata – asked 8 times
- Deterministic Pushdown Automata – asked 2 times
- PDA and CFG Interconversion – asked 6 times
- Two Stack Pushdown Automata – asked 4 times
- Pumping Lemma for CFL – asked 2 times
- Properties of Context Free Languages – asked 1 times
Unit 5: Turing Machines and Recursive Function Theory
- Basic Turing Machine Model – asked 3 times
- Turing Machine Construction Techniques – asked 7 times
- Modifications of Turing Machine – asked 5 times
- Church's Thesis – asked 2 times
- Recursive and RE Languages – asked 8 times
- Recursive Function Theory