One of my previous questions on an exam was the following
Can you reduce a decidable language to a given regular language? (decidable language $\leq _m$ regular language). If so, does this mean that you can reduce every CFL to a regular language?
The reductions are all referring to many-one reductions. My intuition tells me that this is possible as all regular languages are also decidable.