2 votes 2 votes The language $\left\{w w \mid w \in(0+1)^{\ast}\right\}$ is not accepted by any Turing machine accepted by some Turing machine, but by no pushdown automaton accepted by some pushdown automaton, but not context-free context-free, but not regular Theory of Computation goclasses2024-toc-3-weekly-quiz goclasses theory-of-computation pushdown-automata turing-machine 1-mark + – GO Classes asked Jun 27, 2022 retagged Jun 26, 2023 by Lakshman Bhaiya GO Classes 269 views answer comment Share Follow See 1 comment See all 1 1 comment reply Nirupam Das commented Oct 17, 2022 reply Follow Share Ww needs forwards matching which is not possible by PDA.. 0 votes 0 votes Please log in or register to add a comment.
2 votes 2 votes Given language is $ww$ and it is Non-CFL but CSL, so, we have a Turing machine which accepts it. GO Classes answered Jun 27, 2022 GO Classes comment Share Follow See all 0 reply Please log in or register to add a comment.