Automata Theory is a branch of computer science that deals with designing abstract self propelled computing devices that follow a predetermined sequence of operations automatically. An automaton with a finite number of states is called a Finite Automaton. This is a brief and concise course that introduces the fundamental concepts of Finite Automata, Regular Languages, and Pushdown Automata before moving onto Turing machines and Decidability.

Objectives of this lecture:

• It comprises the fundamental mathematical properties of computer hardware, software and certain application .

• The subject has obvious connections with engineering practice, and, as in many sciences.

• Theory has proved its value to other parts of computer science. Many technologists and companies grew up out of the work of theorists. 

• It deals with the definitions and properties of mathematical models of computation.

Lecture Outcomes:

At the end of the session students will be able to know about :

Lecture Contents: