NL Completeness Log space reduction $PATH$ to $EQ_{DFA}$ Let $$PATH = \{(G, s, t) | \exists \text{ a directed path from $s$ to $t$ in $G$}\},$$ 
$$EQ_{DFA} = \{(M_1, M_2) | \text{DFA $M_1$ and $M_2$ over the same alphabet are equivalent}\}.$$
Is there a log space reduction from $PATH$ to $EQ_{DFA}$? 

My attempt was to first show that there exists a DFA that accepts a string iff $M_1$ and $M_2$ do. At this point, I am unsure how to reduce the first problem to the second.
It is easier to think about a reduction from $\overline{PATH}$ (since it is NL-complete, this answers your question in the positive). You can treat the graph as a DFA, with initial state $s$ and a single accepting state $t$, and ask whether this automata is equivalent to some DFA for the empty language. Note that the alphabet here is not really important, and you could simply use fresh letters for each vertex.