1 1 vote Given below are two statements: one is labelled as Assertion A and the other is labelled as Reason RAssertion A: If $L$ is regular, then its compliment $L^{\prime}$ is necessarily regular.Reason R: Complement of a language can be obtained by swapping final and non-final states in a DFA.In the light of the above statements, choose the most appropriate answer from the options given belowBoth $\mathbf{A}$ and $\mathbf{R}$ are correct and $\mathbf{R}$ is the correct explanation of $\mathbf{A}$Both $\mathbf{A}$ and $\mathbf{R}$ are correct but $\mathbf{R}$ is NOT the correct explanation of $\mathbf{A}$$\mathbf{A}$ is correct but $\mathbf{R}$ is not correct$\mathbf{A}$ is not correct but $\mathbf{R}$ is correct Theory of Computation ugcnetcse-dec2025 regular-language finite-automata complement mathematical-logic theory-of-computation + – Shubham Sharma 2 120 views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
0 0 votes Both A and R are correct and R is the correct explanation of A Keshvi 2 answered May 19 Keshvi 2 comment Share Follow 0 reply Please log in or register to add a comment.