Theory of Automata and Formal Languages (BCS402) important topics for AKTU – unit-wise
Topics are ranked by how many times AKTU asked them across 6 papers. Finish the "very likely" topics first, then the top topics of each unit.
High-probability Theory of Automata and Formal Languages topics
- Context Free Grammar (Unit 3: Regular and Non-Regular Grammars) – asked 17 times in 2018, 2019, 2022, 2023, 2024, 2025
- Non Deterministic Finite Automaton (Unit 1: Basic Concepts and Automata Theory) – asked 10 times in 2018, 2019, 2022, 2023, 2024, 2025
- Minimization of Finite Automata (Unit 1: Basic Concepts and Automata Theory) – asked 8 times in 2018, 2019, 2022, 2023, 2024, 2025
What to cover inside these topics
- Derivations and Derivation Trees (part of Context Free Grammar)
- Ambiguity in CFG (part of Context Free Grammar)
- Equivalence of DFA and NFA (part of Non Deterministic Finite Automaton)
- NFA with Epsilon Transition (part of Non Deterministic Finite Automaton)
- Equivalence NFA With Without Epsilon (part of Non Deterministic Finite Automaton)
Most asked Theory of Automata and Formal Languages topics in each unit
- Unit 1 (Basic Concepts and Automata Theory): Non Deterministic Finite Automaton – 10 times; Deterministic Finite Automaton – 8 times; Minimization of Finite Automata – 8 times
- Unit 2 (Regular Expressions and Languages): Regular Expressions – 7 times; Arden's Theorem – 7 times; Pumping Lemma for Regular Languages – 7 times
- Unit 3 (Regular and Non-Regular Grammars): Context Free Grammar – 17 times; Normal Forms of CFG – 5 times; Chomsky Hierarchy – 3 times
- Unit 4 (Push Down Automata and Properties of Context Free Languages): Nondeterministic Pushdown Automata – 8 times; PDA and CFG Interconversion – 6 times; Two Stack Pushdown Automata – 4 times
- Unit 5 (Turing Machines and Recursive Function Theory): Recursive and RE Languages – 8 times; Turing Machine Construction Techniques – 7 times; Modifications of Turing Machine – 5 times