Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Regular Languages and Finite Automata Regular Languages
Consider the following set of statements:
S1: If L1 and L2 are regular languages, then L1 - L2 is also a regular language.
S2: Context free languages are closed under concatenation.
S3: Context free languages are closed under intersection.
S4: Regular language is closed under infinite union of regular languages.
Which of the given statements are true?
1
Both S1 and S2
2
Both S1 and S4
3
Both S3 and S4
4
Both S1 and S3