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

Welcome back.

and 5 others joined a min ago.

6.5kviews

written 6.9 years ago by

pratikj2208 • 150

modified 5.7 years ago by

prashantsaini • 0

automata theory

ADD COMMENT EDIT

1 Answer

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.

enter image description here

State Transition Table -

-	0	1 …

and 5 others joined a min ago.

ADD COMMENT EDIT

Community

Content

Company