Computer Sciences > Gate 2014 Set-1 > Regular Grammar

Contributed by: Dr. Sarah Chen

Report Correct Copyright Claim

Which one of the following is TRUE?

A

The Language L={ aⁿ bⁿ | n≥ is regular }

B

The Language L={ aⁿ | 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

Check Answer

Explanation

Correct : Regular Grammar

Similar Questions

What is the worst-case time complexity of insertion in an AVL tree?

Question #23 Medium

Which operations on a binary search tree have O(h) complexity?

Question #31 Easy

Compare search complexities of sorted array vs balanced BST.

Question #47 Hard

Related Topics

Data Structures Binary Search Tree Time Complexity Algorithm Analysis Tree Algorithms Computer Science