D will be answer

The Gateway to Computer Science Excellence

First time here? Checkout the FAQ!

x

0 votes

L1= Set of all strings having equal number of 00 and 11.

L2= Set of all strings having equal number of 01 and 10.

Which of the following is true?

(a) Both are Regular (b) Both are Context-Free

(c) L1 is regular, L2 is Context Free (d) L1 is CF, L2 is Regular

L2= Set of all strings having equal number of 01 and 10.

Which of the following is true?

(a) Both are Regular (b) Both are Context-Free

(c) L1 is regular, L2 is Context Free (d) L1 is CF, L2 is Regular

0 votes

0

Finite automata can not able to do unbounded comparisons , I am confused now, not able to think about this question ,please simplify it!

0

- At first we take a string which is accepted by dfa . And then compare string 01 and 10 we get equal .

- All categories
- General Aptitude 1.5k
- Engineering Mathematics 7.1k
- Digital Logic 2.7k
- Programming & DS 4.9k
- Algorithms 4.2k
- Theory of Computation 5.3k
- Compiler Design 2.1k
- Databases 4k
- CO & Architecture 3.5k
- Computer Networks 4k
- Non GATE 1.4k
- Others 1.5k
- Admissions 556
- Exam Queries 551
- Tier 1 Placement Questions 23
- Job Queries 69
- Projects 18

47,894 questions

52,261 answers

182,169 comments

67,679 users