I have an assignment where i need to create a Turing machine that decides an infinite language $L\subset \{0,1\}^*$ for which all $L'\subseteq L$, if $|L'|=\infty$, then $L'$ is not a regular language.
I think this is not possible due to Rice's Theorem. It's not possible to tell for a Turing Machine if a language is regular or not.
Moreover, on any given input, the machine can loop so it cannot decide an infinite language $L$.
Is this the right answer? It seems too easy to be the answer... Any input would be appreciable. Thanks in advance.