Register

Equivalence classes

961 views
0 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 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.
Voting & Accepting an answer helps improve the community
← Previous · Deterministic Finite...Next → · bs grewal calculus q...
← Previous in category · Deterministic Finite...Next in category → · Toc-Doubt_1
Position:
Show:

Related questions

3 3 votes
2 2 answers
240
240 views
GO Classes asked Jul 10
240 views
GO Classes DPP | GATE CS | Theory of Computation | DFA-NFA Equivalence
Which of the following is true?A language $L$ is accepted by DFA iff it is accepted by some $\epsilon$-NFA. A language $L$ is accepted by $\epsilon$-NFA iff it is accepte...
5 5 votes
3 3 answers
209
209 views
GO Classes asked Jul 8
209 views
GO Classes DPP | GATE CS | Theory of Computation | NFA Equivalence
Given NFA in the first figure is equivalent to the given DFA in the second figure. Is the given statement true?True False
2 2 votes
4 4 answers
202
202 views
GO Classes asked Jul 7
202 views
GO Classes DPP | GATE CS | Theory of Computation | NFA Equivalence
Consider the following two NFAs $A_1$ and $A_2$. Which one of the following is true?Any string accepted by $A_1$ is also accepted by $A_2$ Any string accepted by $A_2$ is...
1 1 vote
0 0 answers
1.6k
1.6k views
Deepalitrapti asked Jun 5, 2019
1,555 views
Equivalence class toc made easy
How comes 3 states i got 4 states