Consider a language L defined over an alphabet Σ if two strings x and y defined over Σ are run over an FA accepting the language L,then x and y are said to belong to the same __ if they end in the same __.

(A) Class ,state
(B) Final ,infinite
(C) Regular ,nonregular
(D) All of Above

Consider a language L defined over an alphabet Σ if two strings x and y defined over Σ are run over an FA accepting the language L,then x and y are said to belong to the same if they end in the same .