False..

L1=a^nb^m | n=m

L2=a^nb^m| n not equal to m

Both are CFL

But their union gives a*b* which is regular.

L1=a^nb^m | n=m

L2=a^nb^m| n not equal to m

Both are CFL

But their union gives a*b* which is regular.

The Gateway to Computer Science Excellence

- All categories
- General Aptitude 1.9k
- Engineering Mathematics 7.5k
- Digital Logic 2.9k
- Programming and DS 4.9k
- Algorithms 4.4k
- Theory of Computation 6.2k
- Compiler Design 2.1k
- Databases 4.1k
- CO and Architecture 3.4k
- Computer Networks 4.2k
- Non GATE 1.4k
- Others 1.4k
- Admissions 595
- Exam Queries 573
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 18

50,737 questions

57,297 answers

198,265 comments

104,979 users