GATE Computer Science (CS) 2014 Shift 1 Solved Paper

© examsiri.com

Question : 25 of 65

Marks: +1, -0

Which one of the following is TRUE?

The language $L = \{a^{n}b^{n}|.n ≥ 0\}$ is regular.
The language $L = \{a^{n}|.n\:is\:prime\}$ is regular
The language $L = \{w|.w\:has\:3k + 1\:b^{′}s.$ for some k ∈ N with ∑ = {a, b}} is regular.
The language L = {ww|w ∈ ∑* with ∑ = {0, 1}} is regular

Go to Question:

Prev Question

Next Question