Udemy
    •  
    •  
    •  
    •  
    •  
    •  
    •  
    •  
Subscribe
Turn what you know into an opportunity and reach millions around the world.
Learn More
Your cart is empty.
Keep shopping
Fundamentals of Automata Theory
Rating: 4.4 out of 5(541 ratings)
3,718 students

Fundamentals of Automata Theory

Learn about DFA, NFA, Epsilon NFA, Pushdown Automata, Linear Bound Automata and Turing Machine
Created byJithin Parakka
Last updated 6/2020
English

What you'll learn

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

Course content

1 section • 10 lectures • 1h 3m total length

  • Introduction2:39

    Automata theory underpins natural language processing, string processing, search engines, and lexical analysis in compilers, and introduces Chomsky hierarchy with finite automata, push-down automata, linear bounded automata, and Turing machines.

  • DFA7:22
  • DFA Example8:10
  • NFA5:27
  • Epsilon NFA2:30
  • Push Down Automata3:31
  • PDA Example13:52
  • Linear Bound Automata1:35
  • Turing Machine3:28
  • Example for TM15:22

Requirements

  • No

Description

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

Report abuse