retagged by
769 views

5 Answers

3 votes
3 votes
Deriving same strings try writing string set for both language. It will be same
0 votes
0 votes
No .

Because (bx)*b are deriving all strings ending with b

And b(xb)* are deriving all strings starting with b.

Moreover first one can derive the string "bbxxb" whereas second one cannot derive this string.

Hence, they are not equivalent.
0 votes
0 votes
Both Regelar expressions are equivalent

The language derived is a bxbxbxbxb......

In 1st case u r focusing on the 1st 'b'  recursing the rest

Where as in 2nd case u are focusing on last 'b'  recursing what's ahead of it

But ultimately both derive the same language

This is a good example to show that regular expression being non deterministic in nature can have more than 1 regular expressions for the same language

Related questions

1 votes
1 votes
2 answers
1
Shaina Singh asked Jul 30, 2023
512 views
Convert DFA to regular expression
1 votes
1 votes
2 answers
2
0 votes
0 votes
1 answer
3
akash_chauhan asked Jul 20, 2022
419 views
what is the difference between, r* and r^(*) can anyone please elaborate !
1 votes
1 votes
1 answer
4
samarpita asked Nov 21, 2021
537 views
What will be the answer