which is strongest correct about a finite language over some fimite alphabet sigma (E) ?
A) could be undecidable
B)it is TM recognisable
C) it is regular lang
D)it is CSL
answer is option c
but if a language is regular then its also CSL, so that seems more correct right?
shouldnt it be option D