🚀 go-pugleaf

Charles C. Lin <clin@eng.umd.edu> writes:
>>	The language {ww|w E (0 + 1)*} is
>>	(A) not accepted by any Turing machine
>>	(B) accepted by some Turing machines, but by no pushdown automata
>>	(C) accepted by some pushdown automaton, but not context-free
>>	(D) context-free, but not regular
>>	(E) regular

> I recently took the CS GREs, and questions like this do not seem to
> be as prevalent.   While I won't say the entire test is easy, because
> it's not, they do seem to have made somewhat more reasonable questions.

Does any other reader of this newsgroup want to defend the proposition
that this is an "unreasonable" question??  This is about the easiest
nontrivial question one could pose on the theory of computation; either
this question is perfectly reasonable, or there is no need for theory,
and thus for this newsgroup.

                                        David desJardins