edited by
232 views
1 votes
1 votes

Which of the following regular expressions describes the same set of strings as  $\left ( a^*+b \right )^*$  $\left ( c+d \right )$?

  1.   $a^{\ast }\left ( c+d \right )^{\ast } +  b$
  2.   $\left ( a^{\ast }+b \right )c + \left ( a+b \right )d$
  3.   $\left ( a+b \right )^{\ast }c + \left ( a+b \right )^{\ast }d$
  4.   $a^{\ast }\left ( c+d \right )+ b^{\ast }\left ( c+d \right )$
edited by

1 Answer

Best answer
3 votes
3 votes
we know this identity:

$(a+b)$*$=(a$*$ + $b$*)* = (a$*$b$*$)$*$ = (a$*$ + b )$*$ = (a +b$*$)$*$ = a$*$(ba$*$)$*$ = b$*$(ab$*$)$*

$( a$*$ + b )$*$  (c + d) = (a+b)$*$(c + d)$

                            $=$ $(a+b)$*$c + (a+b)$*$d$

option $C$...
edited by
Answer:

Related questions

422
views
1 answers
0 votes
Bikram asked May 14, 2017
422 views
Which of the following languages over the alphabet set $\{ a, b \}$ is described by the regular expression$a^\ast b$(aa)$^\ast b$ ?The set of all strings ... of all strings ending with $ b'$.The set of all strings having sub sequence $bb$.
424
views
1 answers
2 votes
Bikram asked May 14, 2017
424 views
If $L$ is the set of all strings over $\{ x,y\}$ containing at least one $x$, then which of the following regular expressions does not generate $L$?$(x+y)^* x(y+y)^*$y^*x ( x+y)^*$( x+y)^* x$( x+y)^* xy^*$
524
views
0 answers
2 votes
Bikram asked May 14, 2017
524 views
Let $DM$ be a single-tape, Deterministic Turing machine with tape alphabet $\left \{ blank,0,1 \right \}$, and let $C_i$ denote the (possibly infinite) ... during the computation $C_i.$III onlyI and III onlyII and III onlyI, II, and III
755
views
1 answers
4 votes
Bikram asked May 14, 2017
755 views
Consider the languages $A$ and $B$, each over the alphabet set $\left \{ a,b \right \}$.Here, $B=\{ w \mid w$ contains some $x \in A$ as a sub-string $\}.$ ... $B$ is context-free. II only II and III I and III only I, II and III