In Pumping Lemma for context-free languages, to say a language is satisfying pumping lemma, vx what is the minimum length of ' ' together, if you consider the string as 'uvwxy'?
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: B. 1 n
Explanation
The lemma requires |vx| ≥ 1, so at least one of v, x is non-empty; otherwise pumping would change nothing.
More Theory of Computation and Compilers questions
- Which of the following is -free grammar?
- While processing a string by an LR parser, the reading of the given string by the parser is-
- What is the minimum and maximum number of initial, dead, unreachable and final states in a n valid ' ' state finite automaton, where the φ…
- Which of the following finite automata recognize L = {a, b}*? (Transition tables A–D are shown; in each, the start state q0 is accepting.)
- Match List I with List II
- Consider the following statements: (A) For every regular language, we can design Turing Machine (B) For every context free language, we can…