492 views
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 ____________

1 Answer

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.

Related questions

1 votes
1 votes
0 answers
2
Parshu gate asked Jan 6, 2018
647 views
1 votes
1 votes
1 answer
3
Parshu gate asked Nov 27, 2017
1,312 views
Consider a regular language L over Σ={0,1} such that L contains every string which ends with "0". The number of equivalence classes in L is ______.
7 votes
7 votes
2 answers
4
resuscitate asked Dec 5, 2015
11,911 views
The number of equivalence classes which exist for the following regular expression R are ______. $R=(a+b)^*b(a+b+\epsilon )$ what is the meaning of equivale...