Question: If the number of steps required to solve a problem is O(nk), then the problem is said to be solved in:
Options
A : non-polynomial time
B : polynomial time
C : infinite time
D : none of the mentioned
Deterministic Finite Automata-Introduction and Definition more questions
Inorder to simplify a context free grammar, we can skip....
The production of the form A->B , where A and....
Which of the following correctly recognize the symbol '|-' in....
A generalization of P class can be:
Can a DFA recognize a palindrome number?
The value of constants like p and e can be....
What does the following figure most correctly represents?^
Which of the following cannot be solved using polynomial time?
Which of the following is not an example of finite....
Which of the following will not be accepted by the....
Ambiguous Grammar more Online Exam Quiz
Applications of Pumping Lemma/Pigeonhole principle
CFG-Eliminating Useless Symbols
Finding Patterns in Text,Algebric Laws and Derivatives
From Grammars to Push Down Automata
Node-Cover Problem, Hamilton Circuit Problem