1 votes 1 votes A regular expression is $(a+b^{\ast}c)$ is equivalent to set of strings with either $a$ or one or more occurrence of $b$ followed by $c$. $(b^{\ast}c+a)$ set of strings with either $a$ or zero or more occurrence of $b$ followed by $c$. Both (B) and (C) Theory of Computation nielit2017dec-scientistb theory-of-computation regular-expression + – admin asked Mar 30, 2020 retagged Oct 29, 2020 by Krithiga2101 admin 2.0k views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Avdhesh Singh Rana commented Dec 18, 2017 reply Follow Share option D 0 votes 0 votes Sanandan commented Sep 1, 2020 reply Follow Share option D as option B is same as the given regular expression and option c is the correct language. 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes (D) Both (B) and (C) Dileep kumar M 6 answered Dec 18, 2017 Dileep kumar M 6 comment Share Follow See all 0 reply Please log in or register to add a comment.
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..} Arnab Bhadra answered Dec 18, 2017 Arnab Bhadra comment Share Follow See all 0 reply Please log in or register to add a comment.
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 topper98 answered Mar 19, 2020 topper98 comment Share Follow See all 0 reply Please log in or register to add a comment.