Thanks .The explanations in these tutorials are vivid and crystal clear.

A correction : A Pushdown Automata is formally defined by "a 7-Tuple (as in a n-tuple)" NOT "by 7 Tuples" , there is only one tuple (in this case P) containing 7 elements. So, at 1:52 it should NOT be "Capital letter Γ is a Tuple", because Γ is an element of P which is a finite set called the stack alphabet

Thank you, I finally understand PDA. and everything else about automata.

Thanks a lot for your videos Sir

Thank you very much sir, your all tutorials are really helpful for us.

It was extremely helpful. Thanks a lot.:)

Thank you, if I pass my exam I'm going to cry (even if I don't pass probably)

@ricaspinto

3 жыл бұрын

Sir you cry more easy if u pass exam than not pass? Friend one cry is happy cry and one cry is sad cry but you not cri for same reason. Thank you sire

@foreskinfairy

3 жыл бұрын

In the end I passed. Now I have other exams that make my cry.

@ricaspinto

3 жыл бұрын

@@foreskinfairy very nice, i actualy fail now i do again. If i fail again i not only cry but i slap techer sir

@Sahilsharma-sk5vr

Жыл бұрын

@@ricaspinto you slapped teacher??

Very understandable and useful.

Video Summary: The video provides a formal definition of a pushdown automaton using seven tuples. The tuples represent the states, input symbols, stack alphabet, transition function, start state, start stack symbol, and final states. The transition function takes arguments and produces a set of state and stack symbol pairs, indicating changes to the stack. - 00:00 Pushdown automata is formally defined by seven tuples, including a finite set of states, a finite set of input symbols, a finite stack alphabet, a transition function, an initial state, an initial stack symbol, and a set of final states. - 02:17 The formal definition of a pushdown automata includes the start state, start stack symbol, set of final states, and transition function. - 04:37 The transition function in pushdown automata takes three arguments and gives an output of the form P gamma, where P is a new state and gamma is a string of stack symbols that replaces X at the top of the stack. - 06:55 The video explains the transition function of a pushdown automata.

Thanks. Love you @NesoAcademy!!!

Thank you very much!

Thank you so much Sir!!!👍👍👍

EXCELLENT VIDEO very clear instruction and very clear speaking voice thank you :-)

Thank you, Sir.

Thanks for the video

Sorry. You said it outputs a finite set of pairs (p, y) . In that case: What should I replace if I have just one stack?

I have no words # sir to thank you🙏

Thanks!

thanks a lot sir

Huge respect for saving my ass for 3+ years xD

@ricaspinto

3 жыл бұрын

aSS** sir Thank you

may shiva bless your holy work

@vainlegacy7521

5 жыл бұрын

He's muslim

@backslash8874

5 жыл бұрын

@@vainlegacy7521 And how did you know that ??? :3

@tedchirvasiu

5 жыл бұрын

JAI BHOLE KI JAI BHOLE KI

sir please upload lectures on power system..

Thank you..

good job

Thankyou sir

Awesome

love you sir

FYI, δ is the lower-case alphabet symbol for Greek Delta Δ,δ (uppercase-lowercase delta), and is pronounced as : delta, not del :)

@AyushMo

3 жыл бұрын

"δ (uppercase-lowercase delta)".. what do you mean uppercase-lowercase?

@kelvinlikollari1576

3 жыл бұрын

@@AyushMo the first is uppercase and the second is lowercase Δ uppercase delta δ lowercase delta Uppercase = big letter, lowercase = small letter

@AyushMo

3 жыл бұрын

@@kelvinlikollari1576 ah, okay makes sense, thanks.

@shreyash_srivastava

6 ай бұрын

He knows it and is just pronouncng it in a short form as 'del'

Super sirrr

Sir can you please provide some practice questions on push down automata!

@damianwysokinski3285

Жыл бұрын

Check out please next videos in the serie

What about power system sir.. Sir plz continue the power system course , since I m preparing for gate, I need to have complete knowledge of the subject. Plz sir

Pls suggest some PDF links or books for other examples

@Illu07

6 жыл бұрын

Koyeli Paul take a look in Michael Sipser - Introduction to the theory of computation

Sir may you upload lectures on regular basis ?

Turning machine with 2`s complement

is this only for exams? does some work have a career using this?

@novagames5719

Жыл бұрын

Yes if you go in computer research

Exam Question: binary numbers of {0,1} with PDA

@MudassirKhan-ko8po

5 жыл бұрын

U got it pls tell me i need it to I'm from Mumbai University

❤❤❤

👌👌

When will the course complete?

@ricaspinto

3 жыл бұрын

Courses are not living things, they canot complete things. Such as a race. A human can complete a race but course cant. You can say "Hey Sir when you complete that race?" but you cant say " Hey Course when you complete that race?" It not sense i think i don kno. Great video Sir!

Why is my teacher showing us a different way...

@wirito

5 жыл бұрын

PINGPONGROCKSBRAH because your teacher was probably taught in the 70s so he has his own way and style of teaching it.

1.75x

There are no examples.

Lpu students like here lol

MIT-WPU anyone?

@tonylee1868

Жыл бұрын

No

😍👍🏿

Have exam in 30 mins😂

its 2:31 am.I am going to write my exam in few hours.

why all push down automa video have no examples give examples so the people like me can understand (some people can only understand only with examples)

@davidadeyemi7850

5 жыл бұрын

Yea thats true

BINOD

Sir we have not the clear art of teaching sorry for that but i am unable to understand most of your lecture due to low content in your lectures and no full explanation at all

Sir you have not the clear art of teaching sorry for that i hope you will give us better lectures