Redirected
in Theory of Computation retagged by
2,017 views
1 vote
1 vote

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)
in Theory of Computation retagged by
by
2.0k views

2 Comments

option D
0
0
option D as option B is same as the given regular expression and option c is the correct language.
0
0

3 Answers

1 vote
1 vote

(D) Both (B) and (C)

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