Solved

For Two Regular Languages L1 = (A + B)* a and L2

Question 29

Multiple Choice

For two regular languages L1 = (a + b) * a and L2 = b (a + b ) *, the intersection of L1 and L2 is given by


A) (a + b ) * ab
B) ab (a + b ) *
C) a ( a + b ) * b
D) b (a + b ) * a

Correct Answer:

verifed

Verified

Unlock this answer now
Get Access to more Verified Answers free of charge

Related Questions

Q24: TM is more powerful than FSM because<br>A)The

Q25: Let L<sub>1</sub> be a recursive language. Let

Q26: If L and L¯ are recursively enumerable,

Q27: Which of the following statement is wrong?<br>A)Any

Q28: The language accepted by a Push down

Q30: Which statement is true?<br>A)The PDA must have

Q31: Which of the following problem is undecidable?<br>A)Membership

Q32: The following CFG is in S ?

Q33: Pumping lemma is generally used for proving

Q34: Match all items in Group 1 with