This is a snapshot from Dexter C. Kozen - Automata and Computability, Lecture-35, Undecidable problems about CFLs. My question here is that, why should we check triples (3-element substrings)? Why not check if all pairs (2-element substrings match)? I think that pairs (2-element substrings) is a...