Membership problem in context - free languages.

Whether a given context - free language is regular.

Whether a finite state automation halts on all inputs.

Membership problem for type $$0$$ languages.