0

6.6kviews

Design a NFA for a binary number where the first and the last digit is the same

written 6.9 years ago by alemnewmirkuzie3 • 0

modified 5.7 years ago by parviagrawal100 • 0

automata theory

ADD COMMENT FOLLOW SHARE EDIT

1 Answer

0

267views

written 6.6 years ago by teamques10 ★ 70k

modified 6.6 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 SHARE EDIT