Computer Sciences > Gate 2014 Set-1 > Regular Grammar
Which one of the following is TRUE?
A
The Language L={ an bn | n≥ is regular }
B
The Language L={ an | n is prime }
C
The Language L={ w | w has 3k+1 b's for some k ∈ N with Σ ={a,b}} is regular
D
The Language L={ww | w ∈ Σ with Σ ={0,1}} is regular

Correct : Regular Grammar

Similar Questions

A palindrome is a word that reads the same forwards and backwards. In a game of words, a player has the following two plates painted with letters. From...
#1 MCQ
Which number does not belong in the series below? 2, 5, 10, 17, 26, 37, 50, 64
#4 MCQ
Choose the word that is opposite in meaning to the word “coherent”.
#5 MCQ

Related Topics

No tags found

Unique Visitor Count

Total Unique Visitors

Loading......

Question Options

Contributed by: