Assume L1 and L2 are languages on alphabet {a,b}. Which of the following statements is FALSE?
Question 3Answer
If L1 is finite, and L2 is non-regular, then L1∩L2 is regular.
If L1 is regular, then Prefix(L1) is regular. Recall that Prefix(L)={u:∃vuv∈L}.
If L1∪L2 is regular, and L1 is regular, then L2 is regular.
If L1¯¯¯¯¯¯ is regular, then L1 is regular.