edited by
556 views

2 Answers

1 votes
1 votes
Language acceptance by CFL is undecidable.

As easy as that.

Only membership, emptiness and finiteness only decidable.
0 votes
0 votes
let’s assume w= 01

for ww, it will be 0101

Since the first and the last symbol is different.Hence, the problem is undecidable

Related questions

0 votes
0 votes
1 answer
1
admin asked Oct 20, 2019
694 views
Let $X = \{\langle M, w \rangle \mid \text{M is a single-tape TM that never modifies the portion of the tape that contains the input $w$ } \}$Is $X$ decidable? Prove you...