WHICH_OF_THE_FOLLOWING_CAN_REFER_A_LANGUAGE_TO_BE_NON_REGULAR??$ – McqOptions

MCQOPTIONS

1.	WHICH_OF_THE_FOLLOWING_CAN_REFER_A_LANGUAGE_TO_BE_NON_REGULAR??$
A.	Pumping Lemma
B.	Myphill Nerode
C.	Both (a) and (b)
D.	None of the mentioned
Answer» D. None of the mentioned

Discussion

No Comment Found

Related MCQs

Which of the following is not an example of counting argument?
Which of the following can refer a language to be non regular?a) Pumping Lemmab) Myphill Nerodec) Both (
Pigeonhole principle can be applied in the following computer science algorithms:a) hashing algorithmb) lossless compression algorithmc) both (
State true or false:Statement: Pumping lemma gives a necessary but not sufficient condition for a language to be regular.
The time rate of change of velocity of the body is said to be
System international unit of power is known as
The graphs illustrating velocity of the object with time is called
When an object is moved in the gravitational field the work done is a
The equation d = r2-r1 is referred to as the body's
At the surface of the earth where air friction is negligible objects fall with the