LECTURE SERIES TOC

1. Prof.Neeraj Bhargava
Abhishek Kumar
Department of Computer Science
School of Engineering & System Sciences,
MDS, University Ajmer, Rajasthan, India
1

2.  DFA, for each input symbol, one can
determine the state to which the machine will
move. Hence, it is called Deterministic
Automaton. As it has a finite number of
states, the machine is called Deterministic
Finite Machine or Deterministic Finite
Automaton.
2

3. 3

4. 4

5. 5

6. 6