0 votes 0 votes Consider the following regular expression R = a*b* + b*a*. The number of equivalence classes of Σ* to represent a language which is equivalent to R is ____________ sahil_malik asked Oct 7, 2018 sahil_malik 492 views answer comment Share Follow See 1 comment See all 1 1 comment reply aambazinga commented Oct 7, 2018 i edited by aambazinga Oct 7, 2018 reply Follow Share 6. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes I think answer should be 6 because number of equivalence class is equal to number of states of the finite automata including trap state which is 6 in this case. please comment if I am wrong. Sanjay Kumar 7 answered Oct 7, 2018 Sanjay Kumar 7 comment Share Follow See all 3 Comments See all 3 3 Comments reply sahil_malik commented Oct 7, 2018 reply Follow Share yes the answer is 6. 0 votes 0 votes Mayankprakash commented Nov 17, 2018 reply Follow Share @sanjay Can you please show solution in pic. It will be very helpful Thanks 0 votes 0 votes Raghav Khajuria commented Nov 17, 2018 reply Follow Share See it once.. 1 votes 1 votes Please log in or register to add a comment.