I will be your theory of computation and automata theory tutor

Theory of Computation is one of the hardest CS courses. Most tutors explain it mechanically. I explain it the way a mathematician who builds real AI systems does intuition first, then rigor.

TOPICS I COVER:

Automata Theory:

• DFA, NFA, ε-NFA construction, equivalence, minimization
• Regular expressions and their connection to finite automata
• Context-Free Grammars derivations, parse trees, ambiguity
• Pushdown Automata design and CFG equivalence
• Turing Machines variants, Church-Turing thesis

Formal Languages:

• Regular, context-free and recursively enumerable languages
• Pumping Lemmas proving non-regularity and non-CFL
• Chomsky Hierarchy full classification with real examples

Computability and Complexity:

• Decidability and undecidability
• Reductions and the Halting Problem
• P, NP, NP-completeness

MY APPROACH:

• Start with intuition why does this exist?
• Formal definitions precise and clean
• Worked examples on collaborative virtual whiteboard
• PDF session summary after every lesson

Availability: 6am - 8pm PST / 2pm - 4am GMT

️ I do NOT solve exams, homework or graded assignments. Tutoring only.

Tell me your exam date and weak topics I'll build a targeted session around that.