134 views
1 votes
1 votes
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

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
2
baofbuiafbi asked Nov 14, 2023
151 views
Prove the language L={(G,H)|G is a CFG, H is a DFA, and L(G)∩L(H)=∅} is undecidable.