TOC LECTURE SERIES

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

2.  DEFINITION OF NDFA
 EXAMPLES
2

3.  A nondeterministic finite automaton (NFA), or
nondeterministic finite state machine, does
not need to obey these restrictions.
 In particular, every DFA is also an NFA.
Sometimes the term NFA is used in a
narrower sense, referring to a NFA that is not
a DFA, but not in this article.
3

4. :-
The state diagram for M. It is not deterministic since in state p
reading a 1 can lead to p or to q.
Let be an NFA, with a binary alphabet, that determines if the
input ends with a 1.
In formal notation, let where the transition function can be
defined by this state transition table
4

5. THANK YOU
5