Automata Theory Tutorial

What is Automata Theory ?

Automata Theory is known as a part of computer science which deals with designing abstract self-propelled computing devices which can be followed with a predetermined sequence of operations automatically. Here an automaton with unique number of phases is called a Finite Automaton. ThisTutorial explains about basic concepts of Finite Automata, Regular Languages, and Pushdown Automata before moving onto Turing machines and Decidability.

Audience

This tutorial is exclusively designed for the students who are seeking a degree in any information technology or computer science related field. It also provides the essential concepts involved in automata theory.

Prerequisites

This tutorial provides the balance between theory and mathematical rigor. To learn this you should have a basic understanding of discrete mathematical structures