Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more ➡
Standard view
Full view
of .
×
0 of .
Results for:
P. 1
dfa1

# dfa1

Ratings: 0|Views: 865|Likes:

### Availability:

See More
See less

09/11/2010

pdf

text

original

Presentation on NFA & DFA
Topics Covered:
1: Equivalence of NFA & DFA.
2: Conversion of NFA to DFA.

By:
Anuj Dubey
(2nd CSE)

Nondeterministic Finite
Automata
A nondeterministic finite automaton (NFA) is a
mathematical model that consists of
\u2022
A set of states S
\u2022
A set of input symbols\u03a3
\u2022
A transition function that maps state/symbol pairs
to a set of states:
Sx{ + }
set of S
\u2022
A special state s0 called the start state
\u2022
A set of states F (subset of S) of final states
INPUT: string
OUTPUT: yes or no
\u03b5
b
a
STATE
3
3
2
2
1
3
0
0,1
0
Transition Table:
0
1
2
3
a,b
a
b
b
\u03b5
S = { 0,1,2,3}
S0 =0
\u03a3 = {a,b}
F = {3}
Example NFA

## Activity (3)

### Showing

AllMost RecentReviewsAll NotesLikes