Question: are all regular languages decidable?
Answer: Every regular language is Turing-decidable and therefore Turing acceptable / recognisable (but note that Turing acceptable does not imply Turing decidable). ... One can construct a Turing Machine T that simulates D. T's states will be similar to D's.