Automata Theory

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

Watch the Video lectures on Automata Theory (click the following links)

Deterministic Finite Automata DFADeterministic Finite Automata DFA

DFA minimization

Finite Automata with Outputs : Mealy n Moore Machines

You are invited to raise queries by writing your question in the the box given below