Computer Sciences > Gate 2019 > Regular Language
For Σ = {a, b}, let us consider the regular language
Which one of the following can be a pumping length (the constant guaranteed by the pumping lemma) for L?
L = {x ∣ x = a2+ 3k or x = b10 + 12k, k ≥ 0}
Which one of the following can be a pumping length (the constant guaranteed by the pumping lemma) for L?
Correct : Regular Language
Similar Questions
Consider the following languages.
L1 = { wxyx ∣ w,x,y ∈ (0+1)+ }
L2 = { xy ∣ x,y ∈ (a+b)*, ∣x∣=∣y∣, x≠y }
Which one of the following is TRUE ?
Consider the following languages.
L1 = { wxyx ∣ w,x,y ∈ (0+1)+ }
L2 = { xy ∣ x,y ∈ (a+b)*, ∣x∣=∣y∣, x≠y }
Which one of the following is TRUE ?
Consider the following languages.
L1 = { wxyx ∣ w,x,y ∈ (0+1)+ }
L2 = { xy ∣ x,y ∈ (a+b)*, ∣x∣=∣y∣, x≠y }
Which one of the following is TRUE ?
Total Unique Visitors
Loading......