0 0 votes Let $L$ be a regular language and $F$ be a finite language over $\{0,1\}$. Consider the statements: (i) $L \cup F$ is regular, and (ii) $L \cup F^{c}$ is regular, where $F^{c}$ denotes the complement of $\text{F}$. Which of the following statements is correct?Both $\text{(i)}$ and $\text{(ii)}$ are true.$\text{(i)}$ is true but $\text{(ii)}$ is false.$\text{(ii)}$ is true but $\text{(i)}$ is false.Both $\text{(i)}$ and $\text{(ii)}$ are false. Theory of Computation isi2023-mcs-pca regular-language finite-automata theory-of-computation + – admin 351 views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
1 1 vote Answer is option (A)i. L is regular and F is also regular (all finite languages are regular). regular language is closed under Union property, hence L U F will be regular ii. F' is regular as regular language is closed under complement property. Regular union Regular is Regular.Both statements hold param_modi answered Oct 10, 2024 param_modi comment Share Follow 0 reply Please log in or register to add a comment.