0
5.3kviews
Design a NFA for a binary number where the first and the last digit is the same
1 Answer
0
217views

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.

enter image description here

State Transition Table -

- 0 1 …

Create a free account to keep reading this post.

and 5 others joined a min ago.

Please log in to add an answer.