0 0 votes Consider the regular expression R = a*b* + b*a*. The number of equivalence classes of Σ* to represent a language which is equivalent to R is ____________. Theory of Computation theory-of-computation regular-expression finite-automata regular-language + – goluabhinan 1.3k views answer comment Share Follow Print See 1 comment 1 1 comment reply neeti commented Sep 12, 2018 reply Follow flag 2? 0 0 replyShare Please log in or register to add a comment.
Best answer 2 2 votes Equvalance class is equal to no of state in Minimal DFA =6 abhishekmehta4u answered Sep 12, 2018 • selected Sep 12, 2018 by srestha abhishekmehta4u comment Share Follow See all 3 Comments 3 3 Comments reply Rball commented Sep 13, 2018 reply Follow flag Yeah you are correct but you could also give more information about the regex for equivalence class which are associated with each state of dfa for the better understanding of user, 0 0 replyShare sripo commented Oct 10, 2018 reply Follow flag Isn't it a NFA and not a DFA? Hence we would need to convert it right to dfa to get the equivalence class? 0 0 replyShare Rball commented Oct 10, 2018 reply Follow flag The answer submitted is dfa, look closely Further you are correct that is if it was nfa we will need it to convert to dfa(minimal) and then the number of states would be same as that of equivalence class. Please note when we make dfa from nfa then the states of dfa makes number of distinct equivalence classes but looks can be deceiving hence we minimise it for form minimal dfa to find number of distrinct class 0 0 replyShare Please log in or register to add a comment.
