recategorized by
371 views
2 votes
2 votes

Let $r_1$ and $r_2$ be two regular expressions. They symbol $\equiv$ stands for equivalence of two regular expressions in the sense that if $r_1 \equiv r_2$, then both regular expressions describe the same language. Which of the following is/are $\text{FALSE}$?

  1. $\left(r_1 r_2\right)^* r_1 \equiv r_1\left(r_2 r_1\right)^*$
  2. $\left(r_1^* r_2\right)^* r_1^* \equiv\left(r_1+r_2\right)^*$
  3. $\left(r_1^* r_2^*\right)^* \equiv\left(r_1+r_2\right)^*$

 

  1. Only (i) is false
  2. Only (ii) is false
  3. Only (iii) is false
  4. Both (i) and (iii) are false
  5. None of the above
recategorized by

Please log in or register to answer this question.

Answer:

Related questions

3 votes
3 votes
1 answer
4
admin asked Sep 1, 2022
549 views
Which data structure is commonly used to implement breadth first search in a graph?A queueA stackA heapA hash tableA splay tree