–1 –1 vote Theory of Computation + – Ajit J 722 views answer comment Share Follow Print See 1 comment 1 1 comment reply Subarna Das commented Nov 17, 2018 reply Follow flag @ Ajit J , Please $\underline{\color{red}{add}\text{ test-series name in } \color{red}{title}}$. 0 0 replyShare Please log in or register to add a comment.
0 0 votes Just draw the minimal state DFA using the above table and the number of States present in the minimal State DFA will be the number of Equivalence Classes the language given can have. Ashish Roy 1 answered Nov 17, 2018 Ashish Roy 1 comment Share Follow See all 3 Comments 3 3 Comments reply Ajit J commented Nov 17, 2018 reply Follow flag Can you illustrate the process on a paper? 0 0 replyShare Mayankprakash commented Nov 17, 2018 reply Follow flag Answer is 5? 0 0 replyShare Ajit J commented Nov 18, 2018 reply Follow flag Answer given is 3 0 0 replyShare Please log in or register to add a comment.
