Theory of Computation – Study Resources

Syllabus

Regular expressions and finite automata. Context-free grammars and push-down automata. Regular and contex-free languages, pumping lemma. Turing machines and undecidability.

Book

Video

Web Links

More Links Available on GATEPOINT

Questions

  • https://courses.engr.illinois.edu/cs373/fa2010/Exams/midterm1sol.pdf

Leave a Reply

Your email address will not be published. Required fields are marked *