in Theory of Computation retagged by
527 views
3 votes
3 votes

Which of the following strings are a member of the language described by the regular expression $\left(a^* {b} {a}^* b a^* b {a}^*\right)^*$

  1. $b b b b$
  2. $bbaaabb$
  3. $bbaaabbbabb$
  4. $b b a b b b a b$
in Theory of Computation retagged by
527 views

4 Comments

im not able to derive Option C from given regex. For each exp number of b's possible is 3. suppose we assign "bbaaab" to first and "bbab" to second. Remains is 'b' . what am i missing? please help @Deepak Poonia

3
3
I feel C should not be included in the answer as the language is accepting n(b)=3k..
2
2

Answer will be only D.. @Lakshman Bhaiya

1
1
Answer has been modified. Only D is correct.

Language of the given regular expression is set of all strings containing b's in multiple of 3.
3
3

1 Answer

7 votes
7 votes
C isn't possible here, sir. The strings should have b's which are multiples of 3.

2 Comments

Answer has been modified. Only D is correct.

Language of the given regular expression is set of all strings containing b's in multiple of 3.
0
0
answer is D only.

Because numbers of b's should be in multiplies of 3.
0
0
Answer:

Related questions