The number of states in the minimum sized DFA that accepts the language defined by the regular expression $(0 + 1)^{} (0 + 1) (0 + 1)^{}$ is
2

Open in App

Solution

The correct option is A 2
$L = (0 + 1)^{} (0 + 1) (0 + 1)^{} = (0 + 1)^{*}$

2 states.

Suggest Corrections

Similar questions

\sum^{*} 0011 \sum^{*}

\sum = {0, 1}

¯ ¯¯ ¯ L

(a + b)^{*} b (a + b)

{a, b}

L \subseteq {0, 1}^{*}

F o r a g i v e n l a n g u a g e L o v e r (0, 1) * w e d e f i n e t h e o p e r a t i o n i n i t (L) a s . i n i t (L) = (μ μ ρ \in L f o r s o m e ν i n (0, 1} *} L e t L_{1} = (ω ω \in (0, 1) * n_{0} (ω) = n_{1} (ω)} . L e t X d e n o t e t h e l a n g u a g e a c c e p t e d b y i n i t (L_{1}) . T h e n t h e n u m b e r o f s t a t e s i n t h e m i n i m a l D F A o f X i s e q u a l t o_____.

Join BYJU'S Learning Program