(A) Lm
(B) Ls
(C) Lx
(D) Lc
Tag: Theory of Automata
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
There is an approach in defining the quotient of regular languages ie the language Q is said to be quotient of two regular languages P and R, denoted by Q=R/P if?
(A) PQ=R
(B) R=PQ
(C) QR=P
(D) Non of above
If an effectively solvable problem has answered in yes or no, then this solution is called __.
(A) Decision problem
(B) Decision method
(C) Decision procedure
(D) Decision making
If L is a regular language then, Lc is also a __ language.
(A) Regular
(B) Non-regular
(C) Regular but finite
(D) None of the given
For a certain language L, the complement of Lc is the given language L i.e. (L^c)^c = L?
(A) True
(B) False
(C) NA
(D) NA
Let L be a language defined over an alphabet Σ, then the language of strings, defined over Σ, not belonging to L, is called Complement of the language L, denoted by Lc or L’?
(A) True
(B) False
(C) NA
(D) NA
If L1 and L2 are regular languages is/are also regular language(s)?
(A) L1 + L2
(B) L1L2
(C) L1*
(D) All of above