Lec-33: Reversal Operation in toc | How regular languages closured under reversal

preview_player
Показать описание

In this video Varun Sir has discussed Reversal Operation in toc and how regular languages
closured under reversal. The method of Reversal Operation is described in steps and with example.

0:00 - Introduction
0:33 - L raised to power R

►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:
Рекомендации по теме
Комментарии
Автор

I watch ur videos from Kashmir with 2g internet... Ur DBMS lectures cleared my doubts i was literally afraid of DBMS subject before watching ur videos.. Bt ur efforts are priceless... Video was buffering due to low speed internet but wait kiya so that i can comment here.. Keep it up sir... I am very very thankful to u..

shahs
Автор

in these covid times, you are basically our videos not only helped me through my exams but gave me confidence that maybe i can clear gate you

prachipuri
Автор

For everyone asking what would be the initial state in case there's multiple final stages,
Add a new state that leads to all of the (previously) final states with epslion transition. That state can then become start state.

parakhchaudhary
Автор

thank you for all your affords for backbenchers like us.... your videos is really superb and the way you are teaching is amazing.... I m sure I got good marks in upcoming UT and to be honest whatever I learned about TOC so its all just because of I wish I could meet you once ... once again thanks a lot....!!

ChetanSharma-kobt
Автор

Which state should be made the initial state in the reverse language in case of more than one final states in the original language?

twinklekumari
Автор

sir ur explaination is very great any one can't explain this type i am big fen of ur chnal and i watched all vedio for palylist..👍

deepikasoni
Автор

thank you sir for short and crystal clear explanation

shivanisheth
Автор

Sir but Apne dfa ke example(not starting with a or not ending with b) me complement karbaya tha dfa ka
Waha bola tha ki bs final-> non - final
Non- final -> final

ritikshrivastava
Автор

hello sir, pls also provide the questions for practice based on the video topic

S-GauravGhanekar
Автор

If multiple final states then what will be the inital stage in reverse ?

kingsahilbs
Автор

Sir if the dfa has more than one final state

narasimha
Автор

What if we have Multiple FINAL states in M? Will we also convert them into multiple initial states in M'?
btw, thnq soo much for providing these awsm lectures!

souravkumarskb
Автор

Sir...U teach us Very some videos on networking

romukumar
Автор

sir agar ek se jyada final states ho to. konsa initial state banega? there will be ambiguity then

chiragsahasrabudhe
Автор

important protocols of computer networkong

romukumar
Автор

In DFA, every state must have 2 transition states based on given two inputs i.e. a and b. After reversing the given DFA, the final state of the reversed one does not have any next state for a, b. Why?

rsraghav
Автор

sir please complete turing machine part . I will request all viewers to ask sir to complete lectures on turing machine

abhisings
Автор

Sir if there are more than one final state, then how we reverse the machine.

techdatabase
Автор

Sir hmne Dead state ko Final state kyu nahi banaya? Reverse krne k baad

saurabhgautam
Автор

Sir... This dfa is wrong.. Initial state is having transition in symbol b to two states

roshinir