0 0 votes Consider the following statements, which comprises the equality between some regular expressions: S1: ε. ф*= ε. ф+ S2: ф. ф* = ф .ф+ Select the correct option. Both S1 and S2 are correct. Both S1 and S2 are false. 3.S1 is false while S2 is correct. S1 is correct while S2 is fals Theory of Computation regular-expression + – Satbir 1.4k views answer comment Share Follow Print See all 9 Comments 9 9 Comments reply Show 6 previous comments kumar.dilip commented Dec 9, 2018 reply Follow flag S1: ε. ф*= ε. ф+ S2: ф. ф* = ф .ф+ For S1: we can write ф+ = ф.ф* And ф* = ε ε.ε = ε.ф+ ε = ε.ф.ф* ===> ε = ф ====>>> ε != ф ( False) For S2: ф. ф* = ф .ф+ ====>> ф.ε = ф.ф.ф* ====> ф = ф ( True) Option C is correct. 0 0 replyShare Satbir commented Dec 9, 2018 reply Follow flag what does ф , ф+ and ф* denotes ? 0 0 replyShare adarsh_1997 commented Dec 9, 2018 reply Follow flag @Satbir ф means empty language,ε is empty string ф*=ε ф+= фф*=ф.ε=ф 1 1 replyShare Please log in or register to add a comment.
0 0 votes c DeadMann answered Oct 20, 2022 DeadMann comment Share Follow 0 reply Please log in or register to add a comment.