Automata Theory | Theory of Computation Beginner to advanced

Automata Theory | Theory of Computation Beginner to advanced

Many find it very difficult to learn and understand the concepts of Automata Theory. Few are thinking that only people with strong mathematical foundations can master this topic.

Here I am presenting the topic in a rather simple way with the help of simulating tools, animations, and activities that will help you to understand the topic effectively.

The curriculum is created in such a way that it covers all the fundamentals and matches the syllabus of universities around the world.

The lectures are designed in such a way that you don't need to follow the hierarchy and can always jump to the lecture you needed. 

I have included many activities for practice and quiz for your self-test.

DFA | NFA | ε NFA | Push-down Automata | Linear Bound Automata | Turing Machine | Moore & Mealy Machine | Chomsky | Regx

Url: View Details

What you will learn

• Fundamentals of Automata Theory
• Fundamentals of finite state machines: DFA, NFA, Epslion NFA, Moore Machine, Mealy Machine and thier design
• Regular languages and regular expressions

Rating: 3.55

Level: All Levels

Duration: 7.5 hours

Instructor: Jithin Parakka