Automata and Computability
by Dexter C. Kozen · Dexter C. Kozen
Kozen's Cornell senior-level course notes, organized as short self-contained lectures from finite automata and context-free languages through Turing machines and undecidability. Terser and more proof-driven than Hopcroft, with homework sets and exam problems included.
This link may earn us a small commission at no extra cost to you. Affiliate disclosure
More resources on Automata Theory
JFLAP
Free Java software from Duke University for building and running formal-language constructions by hand: finite automata, pushdown automata, Turing machines, grammars and parsers. Students step through conversions such as NFA to DFA and watch each transformation happen.
Automata
Learn automata theory fundamentals with Neso Academy's free course! Explore finite automata, pushdown automata, and Turing machines.
Theory of Computation
Learn automata theory and computation with Prof. Krithivasan! This course explores key concepts, providing a strong foundation in the field.
Introduction to the Theory of Computation (3rd Edition)
Sipser's standard text builds automata, Turing machines, decidability, reducibility, Rice-style arguments and complexity from careful definitions and complete proofs. After it you can prove a problem undecidable by reduction and state the Church-Turing thesis precisely.
brilliant.org
Brilliant.org is an online, interactive learning platform offering problem-based courses in math and computer science, including topics in automata theory, computation, and discrete mathematics, with guided lessons and practice problems.