and 3 others joined a min ago.
0
5.3kviews
Design a NFA for a binary number where the first and the last digit is the same
written 5.3 years ago by
pratikj2208
• 140
|
modified 4.1 years ago
by
prashantsaini
• 0
|
ADD COMMENT
EDIT
1 Answer
0
217views
written 5.0 years ago by
teamques10
★ 64k
|
modified 5.0 years ago
by
yashbeer
★ 11k
|
NFA is formally defined as :
M = (Q, $\epsilon, \delta$, $q_0$, f) . where
Q : finite set of states.
$\epsilon$ : finite set of input symbols.
$\delta$ : Transition function.
$q_0$ : initial state.
F : finite set of final states.
State Transition Table -
| - | 0 | 1 |
|---|---|---|
| $\rightarrow$ $q_0$ | $q_1$ | $q_3$ |
| $q_1$ | $q_2$ | $\phi$ |
| $*q_2$ | $\phi$ | $\phi$ |
| $q_3$ | $\phi$ | $q_4$ |
| $*q_4$ | $\phi$ | $\phi$ |
ADD COMMENT
EDIT
Please log in to add an answer.