Consider the statements:
S1: Regular Expression for the language over the alphabet Σ={a} containing strings whose length is either multiple of 2 or a multiple of 3 (this includes the empty string) is (aa+aaa)*
S2: If L={0m 1n│m≥n and m-n is even} is a Context free language
Which of the above statements are TRUE?( Marks: 2.00 )
Both S1&S2
Only S1
Only S2
Explanation:
S1] Regular expression for the given language is
(aa)*+(aaa)*
S2] Let L1={0n 1n│m≥n} is a Context free language.
L_2={0n 1n│m-n is even}is a Regular language.
And we know that Context free language is closed under intersection with regular language.
∴Lis a Context free language.
None of these
ques:- How is this language regular??
