0 0 votes Theory of Computation + – Deepesh Pai 542 views answer comment Share Follow Print See all 4 Comments 4 4 Comments reply Chaitrasj commented Nov 25, 2018 reply Follow flag I think there exists Turing machine to accept this language. TM can count the number of a's and check if a appears prime no of times, then it has to similarly count for b and check if it's a square and same for c, so there is logic to accept valid strings. 1 1 replyShare Hemanth_13 commented Nov 26, 2018 i edited by Hemanth_13 Nov 26, 2018 reply Follow flag Yes TM is capable of it. But it will be recursive enumerable I think. 0 0 replyShare Shamim Ahmed commented Nov 26, 2018 reply Follow flag If the language is accepted by turing machine, it should be recursive language right? 0 0 replyShare Hemanth_13 commented Nov 26, 2018 reply Follow flag No if TM is capable to reject then it's Recursive 0 0 replyShare Please log in or register to add a comment.
