1.
Select all of the statements below which are TRUE:
If L is a CF language, then L is a REC language but L is not a RE language.
If L is a REG language, then L is also a CF language, CS language, REC language, and RE
language.
If a language L is REC, then L is RE.
Any language L is either REG, DCF, CF, CS, REC, or RE.
For any language L defined on the alphabet , there exists a TM that accepts L.
If L is a CF language, then L is a
REC language but L is not a RE
language.
If L is a REG language, then L is
also a CF language, CS language,
REC language, and RE language.
If a language L is REC, then L is RE.
Any language L is either REG, DCF,
CF, CS, REC, or RE.
Consider a language L defined on the alphabet . Assume
that there exists a TM M that accepts L and that halts on
any string w in +
. Then the language L is a RE language.
For any language L defined on the
alphabet , there exists a TM that
accepts L.
Solution
any language l is either REG, DCF, CF, CS, REC RE