# What is an example of a decidable language?

I know that if a language is regular or context free, the language is decidable. However, if a language is decidable does that imply that it is also regular or context free?

• Your question title doesn't make much sense. You already know that every regular language is decidable; surely you can come up with some examples of those? – David Richerby Dec 18 '18 at 1:16

No.

As an example of a language that is decidable but does not have a context-free grammar is the language over the decimal digits that only contains the prime numbers.

$$\{a^nb^nc^n \ |\ n\geq 0\}$$ is one of the most famous non context-free languages. Consequently, it is also non regular. It is clearly decidable.