Teach on Udemy

Turn what you know into an opportunity and reach millions around the world.

Learn More

Your cart is empty.

Keep shopping

The Complete Theory of Computation

Name: The Complete Theory of Computation
Rating: 4.2 (646 reviews)

Master DFA, NFA, PDA, CFG, Regular Expression, Turing Machine and much more!

Created byLucas Bazilio

Last updated 6/2026

English

What you'll 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 content

14 sections • 97 lectures • 25h 20m total length

Main Topics of the Course4:44
In this lecture, we outline the main topics addressed in the course.

Introduction to Language Theory3:51
We introduce the section on language theory.
Alphabets and Words8:39
We study the fundamentals of Alphabets and Words in Language Theory.
Operations between Words22:29
We study the main operations between words. Among which stand out the Occurrence, Subword, Concatenation, and many more.
Concept of Language26:40
We introduce the concept of Language.
Concatenation of Languages13:46
In this class we study the operation Concatenation of Languages and its main properties.
Quiz - Concatenation of Languages
Power of a Language5:30
We study how to calculate the Power of a Language.
Kleene Closure14:42
We study the Kleene Closure, also called the Kleene Star, on a language L.
Reverse of Words and Languages8:49
We study the Reverse operation in words and languages.
Morphism11:22
We introduce the notion of Morphism in words and languages.
Rule of Replacement6:08
We study the definition of Replacement Rule or Rewrite Rule.

Problem 1 - Module A9:35
We solve module A of problem 1 of the language theory problems section.
Problem 1 - Module B10:47
We solve module B of problem 1 of the language theory problems section.
Problem 1 - Module C6:09
We solve module C of problem 1 of the language theory problems section.
Problem 1 - Module D6:24
We solve module D of problem 1 of the language theory problems section.
Problem 219:25
We solve problem 2 of the language theory problems section.
Problem 39:34
We solve problem 3 of the language theory problems section.
Problem 412:06
We solve problem 4 of the language theory problems section.
Problem 59:05
We solve problem 5 of the language theory problems section.
Problem 65:31
We solve problem 6 of the language theory problems section.
Problem 77:32
We solve problem 7 of the language theory problems section.

Problem 113:02
We solve the first problem of the finite automata section.
Problem 215:44
We solve the second problem of the finite automata section.
Problem 316:00
We solve the problem 3 of the finite automata section.
Problem 412:41
We solve the problem 4 of the finite automata section.
Problem 515:44
We solve the problem 5 of the finite automata section.
Problem 621:43
We solve the problem 6 of the finite automata section.
Problem 724:03
We solve the problem 7 of the finite automata section.
Problem 819:31
We solve the problem 8 of the finite automata section.
Problem 917:50
We solve the problem 9 of the finite automata section.
Problem 1036:13
We solve the problem 10 of the finite automata section.
Problem 1115:17
We solve the problem 11 of the finite automata section.
Problem 1233:28
We solve the problem 12 of the finite automata section.

Problem 115:07
We solve problem 1 of the context-free grammars section.
Problem 214:10
We solve problem 2 of the context-free grammars section.
Problem 316:20
We solve problem 3 of the context-free grammars section.
Problem 416:32
We solve problem 4 of the context-free grammars section.
Problem 519:27
We solve problem 5 of the context-free grammars section.
Problem 615:23
We solve problem 6 of the context-free grammars section.
Problem 713:48
We solve problem 7 of the context-free grammars section.
Problem 819:26
We solve problem 8 of the context-free grammars section.
Problem 919:14
We solve problem 9 of the context-free grammars section.
Problem 1017:46
We solve problem 10 of the context-free grammars section.
Problem 1116:52
We solve problem 11 of the context-free grammars section.
Problem 1222:38
We solve problem 12 of the context-free grammars section.
Problem 1315:46
We solve problem 13 of the context-free grammars section.
Problem 1419:53
We solve problem 14 of the context-free grammars section.

Introduction to Regular Expressions18:51
In this class we introduce Regular Expressions and see a first example of a regular expression.
We also study the Arden's Theorem.
Pumping Lemma26:37
On this lesson we study the pumping lemma. With this lemma we can prove that a language is a
non-regular language.
Pumping Lemma Demonstrations30:43
On this lesson we see some demonstrations of non-regularity of languages using the pumping lemma.

Problem 18:39
In this lesson we solve problem 1 of the problems section on regular expressions.
Problem 210:39
In this lesson we solve problem 2 of the problems section on regular expressions.
Problem 316:51
In this lesson we solve problem 3 of the problems section on regular expressions.
Problem 416:58
In this lesson we solve problem 4 of the problems section on regular expressions.
Problem 515:10
In this lesson we solve problem 5 of the problems section on regular expressions.
Problem 69:17
In this lesson we solve problem 6 of the problems section on regular expressions.
Problem 79:39
In this lesson we solve problem 7 of the problems section on regular expressions.
Problem 812:37
In this lesson we solve problem 8 of the problems section on regular expressions.
Problem 910:55
In this lesson we solve problem 9 of the problems section on regular expressions.
Problem 1016:35
In this lesson we solve problem 10 of the problems section on regular expressions.
Problem 1115:10
In this lesson we solve problem 11 of the problems section on regular expressions.

Requirements

No prior computer science knowledge is necessary.

Description

You’ve just stumbled upon the most complete, in-depth Theory of Computation course online.

Whether you want to:

- build the skills you need to get into Computer Science field

- move to a more senior software developer position

- become a computer scientist mastering in computation

- or just learn theory of computation to be able to create your own advanced programs

...this complete Theory of Computation Masterclass is the course you need to do all of this, and more.

This course is designed to give you the Theory of Computation knowledge and skills you need to become an advanced developer. By the end of the course, you will understand Theory of Computation extremely well and be able to build your own computation projects and be productive as a computer scientist and software developer.

What makes this course a bestseller?

Like you, thousands of others were frustrated and fed up with fragmented Youtube tutorials or incomplete or outdated courses which assume you already know a bunch of stuff, as well as thick, college-like textbooks able to send even the most caffeine-fuelled coder to sleep.

Like you, they were tired of low-quality lessons, poorly explained topics, and confusing info presented in the wrong way. That’s why so many find success in this complete Theory of Computation course. It’s designed with simplicity and seamless progression in mind through its content.

This course assumes no previous coding experience and takes you from absolute beginner core concepts. You will learn the core Computation skills and master computer science. It's a one-stop shop to learn Theory of Computation. If you want to go beyond the core content you can do so at any time.

Here’s just some of what you’ll learn

(It’s okay if you don’t understand all this yet. You will in the course)

Programming Language Theory (PLT)
Turing Machines
Finite Automata
Non-Regular Languages
Equivalence between NFA and DFA
Linear Equations Between Languages
Deterministic Pushdown Automata
Nondeterministic Pushdown Automata
Closing Properties of CFLs and DCFLs
Bidirectional Automata
Chomsky Hierarchy
Morphisms and Substitutions of Regular Languages
Computability of Functions
NP-complete Problems
Computational Reductions
Rice's theorem
S-M-N theorems
Minimization Algorithm

What if I have questions?

As if this course wasn’t complete enough, I offer full support, answering any questions you have 7 days a week (whereas many instructors answer just once per week, or not at all).

This means you’ll never find yourself stuck on one lesson for days on end. With my hand-holding guidance, you’ll progress smoothly through this course without any major roadblocks.

There’s no risk either!

This course comes with a full 30-day money-back guarantee. Meaning if you are not completely satisfied with the course or your progress, simply let me know and I’ll refund you 100%, every last penny no questions asked.

You either end up with Computation skills, go on to develop great programs and potentially make an awesome career for yourself, or you try the course and simply get all your money back if you don’t like it…

You literally can’t lose.

Ready to get started, developer?

Enroll now using the “Add to Cart” button on the right, and get started on your way to creative, advanced Computation brilliance. Or, take this course for a free spin using the preview feature, so you know you’re 100% certain this course is for you.

See you on the inside (hurry, Theory of Computation is waiting!)

Who this course is for:

Anyone interested in working in the computer science sector.
Engineering, science or math students.
Computer engineers who need to specialize in the computational field.
Self-taught developers who want to get a job in the computer science sector.

The Complete Theory of Computation

What you'll learn

Explore related topics

Course content

Course Introduction1 lecture • 5min

Language Theory10 lectures • 2hr 2min

Language Theory Problems10 lectures • 1hr 36min

Finite Automata3 lectures • 48min

Finite Automata Problems12 lectures • 4hr 1min

Context Free Grammars (CFG)3 lectures • 26min

Context Free Grammars (CFG) Problems14 lectures • 4hr 2min

Regular Expressions3 lectures • 1hr 16min

Regular Expressions Problems11 lectures • 2hr 23min

Pushdown Automata (PDA)1 lecture • 24min

Requirements

Description

Who this course is for: