SECTION–A — Conceptual Foundation of Automata Theory (20 Marks)
Section–A consists of ten 2-mark questions, but each question covers a core definition or conceptual building block of Automata Theory. The section starts by asking for the definition of Alphabet and String, which forms the most basic layer of formal languages. This is followed by the definition of Deterministic Finite Automaton (DFA), checking whether the student understands how DFAs use states, transitions, and a deterministic transition function to recognize regular languages.
The paper then asks for a brief explanation of Kleene’s Theorem, which links regular expressions and finite automata, making it a foundational result. The question on Context Free Grammar (CFG) moves students into a deeper class of languages, followed by a practical CFG construction problem for the regular expression (0+1)*.
Section–A also includes questions on distinguishing right-linear and left-linear grammars, both of which generate regular languages. Students are asked to explain Pushdown Automata (PDA) and then extend that by explaining a Two-stack PDA, effectively leading toward Turing machine equivalence. The last two questions introduce higher-level concepts: the basic Turing machine model, which represents the most powerful computation model, and the Halting Problem, one of the fundamental undecidable problems in computation. This entire section evaluates whether the student has a strong grasp of definitions, terminology, and foundational theoretical concepts that appear throughout the course.
SECTION–B — Applied Theory, Conversions & Language Classes (30 Marks)
Section–B asks students to attempt any three out of five long 10-mark questions. These questions require deeper explanations and derivations. The first option asks for a detailed explanation of Turing–Church Thesis and Recursively Enumerable languages, requiring students to describe what functions are considered effectively computable and how RE languages relate to Turing machines.
Another question requires proving closure properties of regular languages including complement, homomorphism, inverse homomorphism, and closure under union/intersection — fundamental results used in language classification. Another option asks for a complete description of the Chomsky Hierarchy, requiring students to explain the four classes (Type-0, Type-1, Type-2, Type-3) and their associated automata.
The next question asks students to convert a CFG into a PDA that accepts by empty stack, requiring transformation of production rules into PDA transitions. The final question of this section asks students to compute leftmost and rightmost derivation trees for the string aababbb using a specific grammar, testing understanding of derivation, parse trees, and sequence of productions.
SECTION–C — Pumping Lemma, NFA Construction & Turing Machine Concepts (20 Marks)
Section–C consists of two parts, and the student must attempt one question from each.
In Q3, one option asks for short notes on Turing Machine as a Computer of Integer Functions and Universal Turing Machine, both central topics in computability. This requires explaining how a Turing machine computes mathematical functions and how a universal Turing machine can simulate any other Turing machine.
The alternate question asks for a detailed explanation of the Pumping Lemma for Regular Languages and its application. Students must describe the lemma formally, the “pumping” property of infinitely long strings in regular languages, and how it is used to prove non-regularity.
Q4 then shifts into construction tasks. One option asks for building an NFA for the language where the third symbol from the right is 'a', which forces students to design a backward-looking pattern recognizer using nondeterminism. The alternate asks to explain the Myhill–Nerode Theorem with an example, which is one of the most important characterization techniques for regular languages and DFA minimization.
SECTION–D — Non-Regularity Proofs, Turing Machine Construction & DFA Minimization (20 Marks)
Section–D contains two long-problem parts.
In Q5, students choose between proving that the language L = {aⁿ bⁿ : n ≥ 0} is not regular using contradiction or pumping lemma. This is a classic example illustrating the boundary where regular languages fail, requiring demonstration that equal counting of two different symbols cannot be handled by finite automata. The alternative question asks to design a Turing Machine for L = {aⁿ bⁿ cⁿ : n ≥ 1}, which requires constructing a multi-step TM that marks and matches symbols across the three segments.
In Q6, students again have two options: proving regular languages are closed under complement, homomorphism, inverse homomorphism, and closure — or minimizing a given DFA shown as Figure A on page 2. The figure shows a multi-state deterministic automaton whose equivalent minimal DFA must be constructed using partition refinement techniques.
SECTION–E — Closure Properties, Decidability & Grammar Ambiguity (10 Marks)
The final section tests higher-level reasoning. One option asks students to explain Closure Properties of Regular Languages and Decidability, meaning they must describe not only closure under Boolean operations but also decision procedures such as emptiness, finiteness, equivalence, and membership problems.
The alternate question provides a grammar
R → R + R / RR / R* / a / b / c
and asks whether it is ambiguous and also requires producing the string w = a + bc*. This checks whether students can detect multiple leftmost derivations, a core problem in syntax design, and can generate valid strings using grammar rules.
FINAL SUMMARY — Full Descriptive Overview
The Theory of Automata & Formal Languages exam paper covers every major component of computation theory. Section–A ensures understanding of basic terms and models such as alphabets, DFAs, PDAs, Turing machines, and halting. Section–B tests deeper topics like language hierarchy, closure properties, CFG manipulations, and PDA design. Section–C focuses on proof techniques like Pumping Lemma, NFA design, and machine concepts. Section–D challenges students with non-regular proofs, Turing machine construction, and DFA minimization. Section–E concludes with closure/decidability theory and grammar ambiguity. Together, the paper evaluates whether students understand both the foundations and advanced reasoning structures used in formal language theory and automata design.
