0 votes 0 votes Answer given as Option (A)...., Choose correct answer and Explain....!!!?? Theory of Computation ace-test-series theory-of-computation identify-class-language + – Meghashyam Sujay asked Jan 23, 2017 • edited Mar 6, 2019 by ajaysoni1924 Meghashyam Sujay 507 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply rahul sharma 5 commented Jan 23, 2017 reply Follow Share I will go with B ,as prime number involves division and CFL cant handle that ,until unless the division is constant. 1 votes 1 votes Meghashyam Sujay commented Jan 23, 2017 reply Follow Share I too..., because prime number implementation not possible by cfl.....!!! 0 votes 0 votes Rashmithkoundinya commented Jan 23, 2017 reply Follow Share The language is Palindrome is wcw^R so it is accepted by cfl. 0 votes 0 votes rahul sharma 5 commented Jan 23, 2017 reply Follow Share How will you check lenght prime? 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes The Language is csl not cfl As no matter what we will have to compute and check |w| is prime which is not possible in CFL as it can handle only one comparison at a time. Therefore, the language is intersection of CFL and CSL wiz CSL only. Abbas2131 answered Jan 23, 2017 Abbas2131 comment Share Follow See all 0 reply Please log in or register to add a comment.
