1 votes 1 votes 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 ______. Theory of Computation equivalence-class theory-of-computation myhill-nerode + – Parshu gate asked Nov 27, 2017 Parshu gate 1.3k views answer comment Share Follow See all 9 Comments See all 9 9 Comments reply Red_devil commented Nov 27, 2017 reply Follow Share 2??? 1 votes 1 votes Parshu gate commented Nov 27, 2017 reply Follow Share Yes. Can u please explain? 0 votes 0 votes abhishek tiwary commented Nov 27, 2017 reply Follow Share i think 2 1 votes 1 votes Ajay Jadhav commented Nov 27, 2017 reply Follow Share final state will accept strings ending with 0 and other with 1 so there are 2 classes. same with even ,odd lewngth string DFA In case string of length n,for n(mod3) DFA will have 3 states,0(final),1 and 2 therefore 3 classes. 0 votes 0 votes abhishek tiwary commented Nov 27, 2017 reply Follow Share one is your language and second is your complement of language so total 2 0 votes 0 votes Parshu gate commented Nov 27, 2017 reply Follow Share what does equivalence classes mean? 0 votes 0 votes abhishek tiwary commented Nov 27, 2017 reply Follow Share no of state in minimal DFA 0 votes 0 votes just_bhavana commented Nov 27, 2017 reply Follow Share equivalence classes is the number of states in minimum dfa 1 votes 1 votes Red_devil commented Nov 27, 2017 reply Follow Share @ Parshu gate equivalence class is nothing but number of states required to build a DFA ,here you need 2 states. 1 votes 1 votes Please log in or register to add a comment.
0 votes 0 votes Number of Equivalence class is equal to the Number of State in the Minimal DFA. There are 2 state in Minimal DFA. so the number of equivalence class is 2. aakashpreetam answered Jun 11, 2018 aakashpreetam comment Share Follow See all 0 reply Please log in or register to add a comment.