theorem the class of nite languages is a proper


Theorem The class of ?nite languages is a proper subclass of SL. Note that the class of ?nite languages is closed under union and concatenation but SL is not closed under either. Nevertheless, this does not contradict the fact that every ?nite language is SLk, for some k. All it says is that the counterexamples that establish non-closure of SL under union and concatenation must involve non-?nite languages. (You should verify the fact that they do.)

Request for Solution File

Ask an Expert for Answer!!
Theory of Computation: theorem the class of nite languages is a proper
Reference No:- TGS0218329

Expected delivery within 24 Hours