Consider the following two statements about regular languages: S1: Every…

PYQ GATE 2021

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?

  1. A.

    Only S1 is true

  2. B.

    Only S2 is true

  3. C.

    Both S1 and S2 are true

  4. D.

    Neither S1 nor S2 is true

Attempted by 318 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…