21CS51 Dayananda Sagar University • Computer Science & Engineering (Semester 5)

Automata Theory and Computability

💡 DSU Exam Strategy & Guidance

DFA/NFA conversions, Regular Expressions, Pumping Lemma for Regular Languages, Context-Free Grammars (CFG), Pushdown Automata (PDA), and Turing Machines.

High-Yield Passing Strategy: Draw clear state transition diagrams for DFA and construct PDA state tables for {a^n b^n | n >= 1}.

Most Repeated Question Topics:

NFA to DFA Subset ConstructionPumping Lemma for Regular Languages ProofPushdown Automata (PDA) DesignTuring Machine for Palindromes / AdditionChomsky Normal Form (CNF) Conversion

📄 Previous Year Question Papers (2)

END_SEM • 2024

End Semester Exam 2024

View PDF ↗

END_SEM • 2023

End Semester Exam 2023

View PDF ↗

Turn 21CS51 Notes into AI Flashcards

Upload your Automata Theory and Computability lecture slides to generate spaced repetition study cards in seconds.

Start Free →