Consider the following two statements about regular languages: S1: Every infinite regular language contains an undecidable language as a subset. S2: Every finite language is regular. Which one of the following choices is correct?
Consider the following two statements about regular languages: S1: Every infinite regular language contains an undecidable language as a subset. S2: Every finite language is regular. Which one of the following choices is correct? Correct Answer Both S<span style="position: relative; line-height: 0; vertical-align: baseline; bottom: -0.25em;font-size:10.5px;">1</span> and S<span style="font-size: 10.5px;">2</span> are true.
Key Points
note that the following statements are true
- Every infinite regular language L has a subset S which is undecidable.
- Every infinite regular language L has a subset S which is unrecognizable.
- Every infinite language L has a subset S which is undecidable.
- Every infinite language L has a subset S which is unrecognizable.
So, S1 and S2 both are correct.
the correct answer is option 4
Explanation: for statements S2 consider the following explanation
every infinite language (regular or not) has an undecidable subset.
With the particular focus on regular languages, the intended solution might have been something like using the pumping lemma to find x,y,z such that xynz is in your language for every n, then consider the subset A = {xynz | n ∈ N}, where A is your favorite undecidable set of natural numbers.
it proves s1 is correct.