Computer Sciences > GATE 2021 SET-2 > Formal Languages
For a string w, we define wR to be the reverse of w. For example, if w = 01101 then wR = 10110. Which of the following languages is/are context-free?
A
{wxwRxR | w,x ∈ {0,1}*}
B
{wwRxxR | w,x ∈ {0,1}*}
C
{wxwR | w,x ∈ {0,1}*}
D
{wxxRwR | w,x ∈ {0,1}*}

Explanation

Correct : b; c; d

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