An NFA is typically described using a directed graph.

Each edge and vertex is

labeled either 0 or 1 representing possible transitions. Vertices represent the
states of the NFA. Those labeled 0 are non accepting states, and those
labeled 1 are accepting states.
 It takes an input string of finite length. Typically, the input string is a
binary sequence of 0’s and 1’s.
 We begin with the vertex 1 which is always the start state and follow the
edges sequentially given by the bits of input string until the input string
has no further bit.
 The term ‘non deterministic’ means that at any state V we have more
than one choice of following an edge. The NFA consumes the input
string and set of states Q represents the possible moves of NFA.
 If Q contains at least one state where the last vertex is accepting then we
say that the NFA has accepted the input string otherwise the NFA has
rejected the input string.

m
e r as
co
eH w
o.
rs e
ou urc
o
aC s
v i y re
ed d
ar stu
sh is
Th

https://www.coursehero.com/file/61320147/NFApdf/

Powered by TCPDF (www.tcpdf.org)