(A) (r1 + r2)
(B) (r2)(r1)
(C) (r1)*
(D) (r1)(r2)
Tag: Theory of Automata
Any language that can not be expressed by a RE is said to be regular language?
(A) True
(B) False
(C) NA
(D) NA
If L is a regular language ,then according to Kleene,theorem , there exists an?
(A) TG
(B) GTG
(C) FA
(D) Non of the given
The current in the wire is indicated by 1 and 0 indicates the absence of the current?
(A) True
(B) False
(C) NA
(D) NA
For the given input, AND box provides the Boolean AND output?
(A) True
(B) False
(C) NA
(D) NA
For the given input, it provides the Boolean OR output?
(A) DELAY box
(B) AND box
(C) NAND box
(D) OR box
Let L be a language defined over an alphabet Σ,then the language of strings , defined over Σ, not belonging to L denoted by LC or L. is called?
(A) Non regular language of L
(B) Complement of the language L
(C) Non of the given
(D) All of above
To describe the complement of a language, it is very important to describe the __ of that language over which the language is defined.
(A) String
(B) Regular Expression
(C) Alphabet
(D) Word