retagged by
269 views
2 votes
2 votes

The language $\left\{w w \mid w \in(0+1)^{\ast}\right\}$ is

  1. not accepted by any Turing machine
  2. accepted by some Turing machine, but by no pushdown automaton
  3. accepted by some pushdown automaton, but not context-free
  4. context-free, but not regular
retagged by

1 Answer

2 votes
2 votes
Given language is $ww$ and it is Non-CFL but CSL, so, we have a Turing machine which accepts it.
Answer: