For Language L1 and L2 prove or disprove
(L1 union L2)*=L1* intersection L2*
For Language L1 and L2 prove or disprove (L1 union L2)*=L1* intersection L2*
Prove that If L1 is linear and L2 is regular, L1×L2 is a linear Language.
Given sigma={a, b} And languages L1, L2 contain in sigma^* I need to prove/disprove the following claim:
Given sigma={a, b} And languages L1, L2 contain in sigma^* I need to prove/disprove the following claim:
Show that if L1 and L2 are recursive languages, then the intersection of the two languages is a recursive language. (You can use diagrams for this also.)
a) if L1 is recognisable but not decidable, L2 is decidable but not recognisable, then prove L1 U L2 is undecidable? b) if L1 is recognisable but not decidable, L2 is recognisable but not decidable, then prove L1 U L2 is undecidable?
Define nor operation for the language as follows. nor(L1, L2) = {w : w E L1 or w E L2} Show that the family of regular languages is closed under the nor operation. Define nor operation for the language as follows. nor(L1, L2) = {w : w E L1 or w E L2} Show that the family of regular languages is closed under the nor operation.
Question 4. Let L1 be the language denoted by ab∗ a ∗ and let L2 be the language denoted by a ∗ b ∗ a Write a regular expression that denotes the language L1 ∩ L2.
Determine if lines L1 and L2 are parallel, oblique or cut. If they intersect, determine the point of intersection. L1 = x / 1 = y-1 / -1 = z-2/3 L2 = x-2/2 = y-3 / -2 = x / 7
Which of the following languages are regular. Prove (by providing a regular expression) or disprove. a. L1 = {ai bj ck dl | (i + j)mod 2 = (k + l)mod 2 , i, j, k, l ≥ 0} b. L2 = {ai bj ck dl | (i + j) = (k + l), i, j, k, l ≥ 0}
Is the following language context free or not? (prove / disprove using pumping lemma for CFL ) L = {0n 1 0n | n >= 1}