42 views

Choose the correct alternatives (more than one may be correct) and write the corresponding letters only:

Which of the following is the strongest correct statement about a finite language over some finite alphabet $\Sigma$ ?

1. It could be undecidable
2. It is Turing-machine recognizable
3. It is a context sensitive language.
4. It is a regular language.
5. None of the above,