Redirected
retagged by
2,022 views
1 votes
1 votes

A regular expression is $(a+b^{\ast}c)$ is equivalent to

  1. set of strings with either $a$ or one or more occurrence of $b$ followed by $c$.
  2. $(b^{\ast}c+a)$
  3. set of strings with either $a$ or zero or more occurrence of $b$ followed by $c$.
  4. Both (B) and (C)
retagged by

3 Answers

0 votes
0 votes

Answer is (D) Both (B) and (C).
a + b*c is same  b*c + a as union operation is commutative.
a + b*c generates either a or zero or more b followed by c
{a,c,bc,bbc..}

0 votes
0 votes

Given regular expression is (a+b*c). It means either a or zero or more occurence of b followed by c. But according to option A, they given “one or more occurences of b”. So, it is false.

Correct option- D

Answer:

Related questions

0 votes
0 votes
6 answers
1
admin asked Mar 30, 2020
2,410 views
According to the given language, which among the following expressions does it correspond to ?Language $L=\{x\in\{0,1\}\mid x\text{ is of length 4 or less}\}$.$(0+1+0+1+0...
1 votes
1 votes
4 answers
2
0 votes
0 votes
2 answers
3
admin asked Mar 30, 2020
703 views
Which of the following regular expression is equal to $(r_1+r_2)^*$?$r_1^*r_2^*$$(r_1r_2)^*$$r_1^*r_2^*+r_1r_2$$(r_1^*r_2^*)^*$
1 votes
1 votes
2 answers
4
admin asked Mar 30, 2020
1,256 views
Which of the following is equivalent regular expressions?$((01)^*(10)^*)^*$$(10+01)^*$$(01)^*+(11)^*$$(0^*+(11)^*+0^*)^*)$(i) and (ii)(ii) and (iii)(iii) and (iv)(iv) and...