Fundamentals of Automata Theory

Learn about DFA, NFA, Epsilon NFA, Pushdown Automata, Linear Bound Automata and Turing Machine
Free tutorial
Rating: 4.3 out of 5 (98 ratings)
2,572 students
1hr 4min of on-demand video

Fundamental Concept of Automatas
Dterministic Finite Automata
Non Deterministic FInite Automata
Finite Automata with Epsilon Transition
Push Down Automata
Turing Machine


  • No


In this course, you will learn the fundamentals of the following Automaton

  1. Deterministic Finite Automata

  2. Non Deterministic Finite Automata

  3. Non Deterministic Finite Automata with Epsilon Transition

  4. Push Down Automata

  5. Linear Bound Automata

  6. Turing Machine.

Note that only the definitions and an example of each automaton are thought here because the free course in Udemy has some limitations.

You can take this course to have brief idea about various automata. If you wish to learn in more detail, I recommend you to take the course Introduction to Theory of Computation offered by me.

Who this course is for:

  • Computer Science Students
  • GATE Aspirants


CTO and Cofounder @ Mapletechspace.com
Jithin Parakka
  • 3.8 Instructor Rating
  • 199 Reviews
  • 5,856 Students
  • 4 Courses

Jithin Parakka is Professor and Head of the Department of Computer Science and Engineering, St. Thomas College of Engineering & Technology, Kerala, India. Jithin Parakka has many years of teaching experience and is very enthusiastic towards e-learning. His area of interest includes, Data structures, Algorithm design and analysis, Automata theory and Compiler design.

Top companies trust Udemy

Get your team access to Udemy's top 19,000+ courses