Question: The language define by the equality of two 2DIM-DFA machines on all inputs is un-decidable. The full definition of 2DIM-DFA can be found in Sipser's "Introduction to the Theory of Computation" (5.17)
I show a reduction to the decidability of a problem which is known to be un-decidable and hence prove the un-decidability of the original language.