0
5.3kviews
Design a NFA for a binary number where the first and the last digit is the same
1 Answer
written 5.1 years ago by | modified 5.1 years ago by |
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 … |
---|