The Complete Theory of Computation
Master DFA, NFA, PDA, CFG, Regular Expression, Turing Machine and much more!
4.63 (589 reviews)
2 756
students
25.5 hours
content
Dec 2024
last update
$79.99
regular price
What you will learn
Be able to describe languages according to formal systems such as automata and context-free grammars
Master the fundamentals of Turing machines
Know the capabilities and limits of computing
Master solving NP complete problems
Understand Finite Automata and Bidirectional Automata in depth: DFA, NFA, PDA and many more!
Learn to classify problems within the Chomsky hierarchy
Learn the classification of problems on decidability
Know the Morphisms and Substitutions of Regular Languages
Hundreds of practical exercises with solutions and quizzes
Course Gallery
Loading charts...
Related Topics
4682980
udemy ID
11/05/2022
course created date
16/06/2022
course indexed date
Bot
course submited by