Lec-35: INIT Operation in TOC

Varun sir discusses what is INIT Operation in toc. He has also explained how regular languages are closed under INIT Operation.

0:00 - Introduction
0:15 - INIT

►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:

[shireeshkumar]

It is not the correct way to prove whether a language type is closed under a operation, refer to nptel or mit lectures to understand the actual essence, will help u a lot

[mohdmaazazhar]

Sir if we have some regular language L1, and there is some opertion op(L1) which is generating a language by deleting 1 alphabet at a time from all the strings of L1 for example if we have L1={a, aba, aab}
Then op(L1) ={e, ab, ba, aa}
As from first string a we delete 1 alphabet it will give e and in case of "aba"we will get ab and ba and in case of " aab" We get aa and ab ignoring repeating strings we get
op(L1) ={e, ab, ba, aa}
Now, my question is that, will regular language will be closed under this operation
I tried to apply this on some regular language like a*b and in result i am getting a regular language
Like L=a*b={b, ab, }
op(L)= {e, a, b, ab, aa, aaa, aab, aaab, aaaa, .... . }
If regular languages are closed under this operation then how can we prove that it is closed

[missionunstoppable]

00:01 Explanation of INIT operation in TOC
00:49 The INIT operation in TOC involves determining if a given language belongs to a given class.
01:35 Understanding prefixes in INIT operation
02:24 Regular languages are closed under INIT operation in TOC
03:05 DFA design principle and state notations
03:46 Explained the key idea 'INIT' operation in TOC
04:27 Discussion on final and non-final states
05:08 Regular languages are closed under each operation.
Crafted by Merlin AI.

[amitgoswami]

Thanks a lot sir...you are awesome sir...

[yash]

4:38 मेरे विचार से बेहतर समझ के लिए logic होगा कि final state से पीछे की ओर चलो और जो भी आएँ सबको final बनाते चलो। पर हाँ, सामान्य DFA में इस तरीके से भी अँततः परिणाम वही होगा

[arshidwani]

Sir I repeat same question..are u going to cover compiler design too in this course ?

[satyampal]

init me sare state final state ho skte h??

[dheerajjaiswal]

sir nic ke liye kaise prepration kare apke ke video gate level tak hai please help