Lec-37: Closure Properties Of Various Languages in TOC | Theory Of Computation

In this video, Closure Properties Of Various Languages in TOC is discussed. Questions related to this topic are found most of the times in competitive exams.

0:00 - Introduction
0:28 - Closure
5:03 - DCFL
6:34 - CFL

►Theory of Computation (Complete Playlist):

Other subject-wise playlist Links:
--------------------------------------------------------------------------------------------------------------------------------------
►Design and Analysis of algorithms (DAA):
►Database Management System:
► Software Engineering:
►Artificial Intelligence:
►Computer Networks:
►Operating System:
►Structured Query Language (SQL):
►Discrete Mathematics:
►Compiler Design:
►Number System:
►Cloud Computing & BIG Data:
►Programming in C :
►Data Structure:
►Computer Architecture :
►Graph Theory (Complete Playlist):
►Digital Logic:

---------------------------------------------------------------------------------------------------------------------------------------
Our social media Links:
--------------------------------------------------------------------------------------------------------------------------------------
►For Any Query, Suggestion or notes contribution:

[sahilsharma]

I think one day you'll teach whole computer science in one short lecture. hats off to you SIR

[priyankachatterjee]

Sir itna din e table ratta mar raha tha. closure kya hay clear idea hi nahi tha. apka e video se idea clear hua. avi exam me nahi vulenge. thank you sir

[mrunalshende]

this video comes from nowhere like you haven't completed pda, cfl, dcfl, cfg and all
i think this video should be placed at no . 55 or 54 so everybody should get whats u r trying to say .
its an honest review.
love your videos ...

[smitdhimar]

Out of context video, dont know tf abt cfl and all stuff

[squareroot]

1. 3:38 onwards, There is nothing called closure properties of grammars. and a^n is not a grammar.
2. 10:55 Concatenation operation : a^nb^n concatenated with b^nc^n is a^nb^nb^mc^m and not what you wrote there. I think you need to watch other youtube videos bro. Take care

[rajkumarr]

I am new this Channel, But i really like your method of teaching brother and i have gone through the playlist, it is awesome.... I think I have found the right channel for my

[gargseema]

Very good & easy way explained .
Sir plz make full course vdo on TOC and AI .Its a humble request.

[monikasiwach]

thanku sir for implement our request ur support is more and more helpful for net aspirant again thanks

[lordstinson]

Good video, but I think you got concatenating at 10:53 wrong. If you concat language {a^n b^n} and language {b^n c^n}, the result will be a language {a^k b^k b^n c^n} or more simply {a^k b^(k+n) c^n}, and *not* {a^n b^2n c^n}

[K-bhdz]

hlo bhaiya good morning before 20th dec.(i think sabke CS ke xam issi date ko fall ho rahe hei ..so 18th n 19th ko aap most topic revision karwa sakte ho....? little bit anxiety ho rahi h .so revision se tense-free hone ka chance mil jayega hope so u r agreed.bcoz aap smoothly deal karte ho topic so confident ho jati hun ki ...my concept on these paryicular topic is cleared now.

[ORitvikSardhyal]

concepts are cleared and you're definitely amazing! but sir after lec-36, I can see the playlist somehow lose right way
😐 or maybe after that(lec-36) mixed up... plz do something about it.😇😇

[soumambanerjee]

Sir see u r saying at 11:07 that
( a^n b^n . b^n c^n) =a^n b^2n c^n
But if we see carefully the left expression ka n and right expression ka n are not equal
Therefore its should be
a^n b^(n+m) c^m
Which makes it dCFL so by this example it can't be proven i guess.
Two dcfl under concatenation can't give csl right??? I mean it will give ncfl at most which itself is a subset of csl

This can also be proved by your table. See you have taken 2 DCFL and concatinated them and say they are not closed for some other example (here its closed) . Thats well and fyn

But since they are dCFL, therefore they are NCFL also right??? And ncfl is closed under concatenation. Hence its prooved its not csl :)
BUT IT IS NCFL ATMOST WHICH IS A SUBSET OF CSL


CORRECT ME PLZZZZ IF AM WRONG


Anyways besides this glitch its perfectly fyn..

[deepamgupta]

This is gonna fetch me good marks in GATE.

[aradhanakumari]

Hey..
Can you make complete TOC video. Lectures on purpose of Gate CS 2020. Thanks all clearing all doubts .

[shinkukumar]

Thank you sir for all the videos....plz upload videos on logical families in digital electronics.

[shethnisarg]

why there are different rows for Union and + ?

[reddyharika]

U have mountains of knowledge on all computer science topics..how????
Targeted teaching.love your way..
TOC series banavo bhayya.. before ugc net...plz...plz..

[shivnericreation]

Sir your lectures are too good,
But in this lecture you haven't explained what is cfl, dcfl, dcsl .

[Gautamsingh-dycp]

Sir plz upload deciadibilty of language...From toc

[surajkolekar]

In regular language if we take complement of finite we get infinite . So how complement is closed for RL??