Let

$\backslash$Sigma

$=$

$\{$

$0$

$,$

$1$

$\}$

$\backslash$Sigma $=\{0,1\}.$ Consider the following language:

$$

$=$

$\{$

$$

$$

$$

is a binary representation that has decimal value

$$

where

$2$

$<=$

$$

$<=$

$5$

$\}$

B$=\{$w$$w is a binary representation that has decimal value v where $2<=$v$<=5\}$

Give a state diagram of a DFA that recognizes the language B$.$

No file chosen