retagged by
711 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$
retagged by

3 Answers

7 votes
7 votes
C isn't possible here, sir. The strings should have b's which are multiples of 3.
0 votes
0 votes
Answer is d as it will only have 3,6,9,12.......means 3n b
Answer:

Related questions

362
views
0 answers
4 votes
GO Classes asked Feb 5
362 views
DeMorgan's Laws ensure thatClosure under intersection and complementation imply closure under union.Closure under intersection and union imply closure under ... union, intersection, and complementation implies closure under all three.
792
views
2 answers
4 votes
GO Classes asked Feb 5
792 views
Consider the following network, which consists of two routers (R1 and R2), two switches (S1 and S2), and four hosts (H1, H2, H3, and H4). ... will have destination mac address of R2Packet leaving R2 will have destination mac address of S2
834
views
1 answers
13 votes
GO Classes asked Feb 5
834 views
Let $\mathrm{G}$ be a simple undirected graph on 8 vertices such that there is a vertex of degree 1 , a vertex of degree 2 , a vertex of degree 3 , ... the following can be the degree of the last vertex? (Select all that are possible)0348
578
views
1 answers
4 votes
GO Classes asked Feb 5
578 views
Which of the following frequencies for A,B,C and D can generate the following Huffman tree? (Select all that apply.)$p_A=0.4, p_B=0.3, p_C=0.2, p_D=0.1$p_A=0.35, p_B=0.25, ... .25, p_C=0.25, p_D=0.25$p_A=0.2, p_B=0.35, p_C=0.2, p_D=0.25$