Question: Which of the following can refer a language to be non regular?
Options
A : Pumping Lemma
B : Myphill Nerode
C : Both (a) and (b)
D : None of the mentioned
Applications of Pumping Lemma/Pigeonhole principle more questions
Which of the following parser performs top down parsing?
Which of the following parser reaches the root symbol of....
An exact cover problem can be represented using:
For which of the following, greedy algorithm finds a minimal....
If n objects are distributed over m places, and n....
Which of the following fields may have pigeonhole principle violated?
Which of the following is not an application of Pumping....
Which of the following is not an example of counting....
Which of the following problems do not belong to Karp's....
Which of the following problems were reduced to Knapsack?
Ambiguous Grammar more Online Exam Quiz
CFG-Eliminating Useless Symbols
Deterministic Finite Automata-Introduction and Definition
Finding Patterns in Text,Algebric Laws and Derivatives