I am trying to use the computation histories argument to fit this. But I am unable to find this as yet. 
Is the problem that intersection of two cfl is a cfl or not undecidable?
computability;context free