List of practice Questions

Which of the following statements is/are TRUE?

Which of the following is/are undecidable?

Consider the following two statements about regular languages:
\(S_1:\) Every infinite regular language contains an undecidable language as a subset.
\(S_2:\) Every finite language is regular.
Which one of the following choices is correct?

Let \(\langle M \rangle\) denote an encoding of an automaton \(M\). Suppose that \(\Sigma = \{0,1\}\). Which of the following languages is/are NOT recursive?

For a Turing machine \(M\), \(\langle M \rangle\) denotes an encoding of \(M\). Consider the following two languages: \[ L_1 = \{\langle M \rangle \mid M \text{ takes more than } 2021 \text{ steps on all inputs}\} \] \[ L_2 = \{\langle M \rangle \mid M \text{ takes more than } 2021 \text{ steps on some input}\} \] Which one of the following options is correct?