We continue on a recent concept introduced by Kariuki and Okoth, about skew 2-Dyck paths, introducing an additional down-step $L$, together with the usual steps $U$ (up) and $D$ down. There is the syntactical condition that $UL$ and $LU$ can never occur. An automaton that checks these conditions is introduced, and the relevant generating functions are obtained by applying the kernel method to three functional equations. It is briefly discussed how the setting can be extended to $t$-Dyck paths. As a benefit, prefixes of skew $t$-Dyck paths are also enumerated. An approach that scans 2-Dyck paths from right to left is also discussed.