Theory of Computation Tutor, Graduate of Columbia University

I’m a mathematician and computer science specialist, with over ten years of experience teaching advanced subjects. I maintain a five-star rating on my WyzAnt profile.

I’m offering tutoring for courses on the theory of computation, sometimes also called “automata, languages, and complexity”, or “foundations of computer science”, “formal languages” and so on. The specific topics are proof-based and algorithmic treatment of the following.

• Finite state automata (deterministic, nondeterministic, push-down, linear bounded, Turing machines)

• Regular languages, DFAs, NFAs, and regular expressions

• Context-free languages (CFLs), context free grammars (CFGs), PDAs

• Context-sensitive languages (CSLs), context sensitive grammars, LBAs

• Recursively enumerable languages (REs), TMs

• Decidability and reductions

• Time-complexity and polynomial time reductions.

I’ve tutored this subject for students at the following universities.

• University of Washington CSE 431

• Rice University COMP 481

• BU CS 332

• Brown University CSCI 1010

• University of Oregon CS 420

• Cal Poly CSC 445

• CUNY CS 457