WebsitebeginnerPaid
Brilliant.org - Theory of Computation
Unknown
Interactive problems on formal languages
More resources on Formal Languages
CourseFree
Theory of Computation
Learn computability theory with Kamala Krithivasan's Theory of Computation course. Explore fundamental concepts and problem-solving!
WebsiteFree
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.
BookPaid
Formal Languages and Their Relation to Automata
The 1969 monograph that organized formal language theory around the Chomsky hierarchy, pairing regular, context-free, context-sensitive and recursively enumerable languages with finite automata, pushdown automata, linear bounded automata and Turing machines. Proof-based; readers learn the classical closure and decidability results.