For a given language L over0-1- we define the operation initL as-initL- - - - L for some - in0- 1- Let L1 - - -0- 1- n0- - n1- Let X denote the language accepted by initL1-Then the number of states in the minimal DFA of X is equal to -

The nbsp;thing nbsp;to nbsp;note nbsp;here nbsp;is nbsp;that nbsp;, nbsp;init nbsp;L1=0+1*Therefore nbsp;for nbsp;0+1*, nbsp;we nbsp;o ...

You visited us 1 times! Enjoying our articles? Unlock Full Access!

For a given l...

Question

$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_____.$

Open in App

Solution

Suggest Corrections

Similar questions

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

W e d e f i n e t h e p o w e r s o f a s t r i n g ω o v e r t h e c o n c a t e n a t i o n o p e r a t i o n (*) a s f o l l o w s : ω^{0} = \in ω^{i + 1} = ω^{i} . ω (1^{3} + 1^{2019}) * + (1^{6} + 1^{2016}) * 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 v e r t h e u n a r y a l p h a b e t (1}) o f t h e l a n g u a g e c o r r e s p o n d i n g t o t h e r e g u l a r e x p r e s s i o n i s e q u a l t o______.

L ((11^{*} 0 + 0) (0 + 1)^{*} 0^{*} 1^{*})

{0, 1}

\sum

{1, . . . . ., 5}

{1, . . . . ., 5}

\forall j

\circ

x = x_{1} x_{2} . . . x_{n} ϵ \sum^{n}, n \geq 0, l e t π (x) = x_{1} \circ x_{2} \circ . . . . \circ x_{n}

{x ϵ \sum^{*} ∣ π (x) = i d}

L (M) \cap L (N)

Join BYJU'S Learning Program