Formal Languages and Automata theory

Formal Languages and Automata theory

The Highlights of the of the course:

1.Introduction to Automata theory.

2.Types of Formal Languages(Chomsky hierarchy).

3.Finite Automata and Types.

4.Total 22 DFA problems and solutions clearly explained.

5. DFA Conversions,Operations & Equivalence.

6. DFA minimization using

              a. Equivalence method.

              b.Table filling method.

6. Pushdown Automata.

7.Total 8 PDA problems and solutions clearly explained.

8.Turing machines.

9.Total 5 TM problems and solutions clearly  explained.

Theory of Computation and problem solving

Url: View Details

What you will learn

• Formal Languages and Automata theory

Rating: 4.25

Level: Beginner Level

Duration: 6 hours

Instructor: shravan Kumar Manthri