Yes correct. More precisely, we have presented algorithms for the membership problem for REG and for CFL, and have observed that those algorithms work in polynomial time on a standard computer. We have also mentioned in some lecture that if a problem is polynomial time in a standard computer, then it is polynomial time for TM.