0 0 votes Is it possible to prove number of b's=2k+1 and any number of a's is regular using Myhill–Nerode theorem ? Theory of Computation theory-of-computation + – Angkit 551 views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
0 0 votes yes but i dont knw how to prove..but i have read some where that myhill-nerode theorem provide sufficient and necessary condition for language to be regular gabbar answered May 6, 2017 gabbar comment Share Follow 0 reply Please log in or register to add a comment.
