In Pumping Lemma for regular languages, to say a language is satistying pumping lemma, what is the mınımum length of ' y ' if you consider the string as ' x y z '?
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: C. 1
Explanation
In xyz the pumped part y must be non-empty: |y| ≥ 1.
More Theory of Computation and Compilers questions
- The item generated by the production is :
- In the ε-NFA M = ({q0, q1, q2, q3}, {a}, δ, q0, {q3}) with δ: q0 –ε→ q1, q1 –ε→ q2, q2 –a→ {q2, q3}, and no other moves, what is the minimu…
- Which of the following is (are) correct? 1. The language for the given expression is L = {aⁿbⁿcᵐdᵐ | n ≥ 1, m ≥ 1} ∪ {aⁿbᵐcᵐdⁿ | n ≥ 1, m ≥…
- Which of the following are correct for regular expressions? a. ∅ + L = L + ∅ = L b. εL = Lε = L c. ∅L = L∅ = ∅ d. ∅L = L∅ = L
- Match the following based on the language accepted by using brute force method of parsing.
- What is the safest order while simplifying Context Free Grammar? ∈