This question was previously asked in

GATE CS 2014 Official Paper: Shift 2

- L
_{1}is regular but not L_{2} - L
_{2}is regular but not L_{1} - Both L
_{1}and L_{2}are regular - Neither L
_{1}nor L_{2}are regular

Option 1 : L_{1} is regular but not L_{2}

Free

Official Paper 1: Held on 24 Sep 2020 Shift 1

13272

50 Questions
100 Marks
60 Mins

DFA of L_{1} is possible so L_{1 }is regular.

Suppose string 011011011 in this string number of occurrences of 011 is 3 but number of occurrences of

110 is 2 so if we append 0 at the end then number of occurrences of 110 will also be 3.

So, using this idea, we can construct DFA of L1.

DFA:

In L_{2} DFA cannot be constructed and hence L_{2} is not regular.

__NOTE:__

L_{2} is context free grammar.

India’s **#1 Learning** Platform

Start Complete Exam Preparation

Daily Live MasterClasses

Practice Question Bank

Mock Tests & Quizzes

Trusted by 2,19,14,608+ Students

Start your FREE coaching now >>

Testbook Edu Solutions Pvt. Ltd.

1st & 2nd Floor, Zion Building,

Plot No. 273, Sector 10, Kharghar,

Navi Mumbai - 410210

[email protected]
Plot No. 273, Sector 10, Kharghar,

Navi Mumbai - 410210

Toll Free:1800 833 0800

Office Hours: 10 AM to 7 PM (all 7 days)