Theory of Computation: NPDA Example (w w^r)

  Рет қаралды 160,582

Anita R

Anita R

Күн бұрын

Пікірлер: 56
@pike-nt1fn
@pike-nt1fn 2 жыл бұрын
This is far more understandable than lectures at my University. Thank you.
@JoseSeverinoFerreiraBarboza
@JoseSeverinoFerreiraBarboza Жыл бұрын
Perfect she!!
@DrAmitkumarPathak
@DrAmitkumarPathak Жыл бұрын
Well explained but it may show little bit confused bcse your taking two strings simultaneously whenever discussing the same concept
@kshitijvarshneynv1929
@kshitijvarshneynv1929 2 жыл бұрын
How can we determine that we reached in the middle of the string
@ashinkunjumon1111
@ashinkunjumon1111 3 жыл бұрын
Can't just one example string be used since i feel like it becomes more complex
@nimishageek4148
@nimishageek4148 2 жыл бұрын
choose small string
@KelvinAnil
@KelvinAnil Жыл бұрын
Eth aara😆
@tonypepper
@tonypepper Жыл бұрын
Mam , please help... So in all the questions , if we take one example and do the answer , while considering the other probabilities , it will be true for any ?? And when do we know to change states?
@dibyaprakashbal1649
@dibyaprakashbal1649 Жыл бұрын
why we use epsilon here ,given epsilon is not accepted here ,condition is (a+b)+ -here epsilon is not accepted
@vaidhegidinesh3769
@vaidhegidinesh3769 7 ай бұрын
yes...how is it possible? also, eplison in the input string means that the input string is fully consumed. how can we use that in the middle of the string?
@manavgkrishna4766
@manavgkrishna4766 3 жыл бұрын
Why can't we just take one string instead of 2? only 011110.
@AmanYadav-ou4xi
@AmanYadav-ou4xi Жыл бұрын
Because the w is (0+1) which means or taking 1 at a time.
@ajraye753
@ajraye753 Жыл бұрын
How can the automata know it has reached the middle of the string and take epsilon as input rather than the next one?
@Anonymous-om7sq
@Anonymous-om7sq Жыл бұрын
that's the point, it chooses between the different paths, at least in one path the string will be accepted.
@Redgum-z3i
@Redgum-z3i Жыл бұрын
@@Anonymous-om7sq thanks
@Alliswell-lb5td
@Alliswell-lb5td Жыл бұрын
Mam your lecture is easily understandable tq mam..love u mam ..😁
@dheebanaakkashs524
@dheebanaakkashs524 2 жыл бұрын
For 2) step y u considering epsilon to move q1 state, wat is the need...? Pls....
@kdramaafeels
@kdramaafeels Ай бұрын
can somebody please explain what is the difference between ndpa and pda cause here in npda we are defining transition of each symbol like we do in dfa ??? So confused...
@PnutJpg
@PnutJpg 2 жыл бұрын
the automata doesn;t know counting then how can you say that you have reached the middle part of the string??
@i_Ankit
@i_Ankit 2 жыл бұрын
see 2nd step
@NoushinMohammad-t8y
@NoushinMohammad-t8y 7 ай бұрын
All possible pairs are pushed
@PnutJpg
@PnutJpg 7 ай бұрын
@@NoushinMohammad-t8y i already passed my MCA a year ago hahahaha
@znixed
@znixed 3 ай бұрын
😂😂​@@PnutJpg
@F_KNATARAJU
@F_KNATARAJU 2 жыл бұрын
how we know that we reached middle or not?
@harshalmali856
@harshalmali856 Жыл бұрын
same question i have please tell me the answer i have paper on 29 nov
@omkarkulkarni8680
@omkarkulkarni8680 Жыл бұрын
@@harshalmali856 mam has addressed this issue in the later part of the video while drawing ID. see the tree mam has drawn, it considers epsilon input at each step! hope this helps
@arminsafiri4031
@arminsafiri4031 3 жыл бұрын
in general, when do we go to next state like q0 to q1?
@chiluvurideepthi6822
@chiluvurideepthi6822 3 жыл бұрын
When the input Symbol changes, we have to change the State.
@samsons8279
@samsons8279 3 жыл бұрын
When we change the operation on the stack.. Suppose we perform a series of push() operations from state q1 ; and suddenly a pop() operation , then the state is changed from q1 to q2 after pop().
@AryanSharma-zs8yl
@AryanSharma-zs8yl 2 жыл бұрын
This explanation confused me she says something thing and does something opposite Her English is broken it's so hard to understand
@bobler4193
@bobler4193 Жыл бұрын
It was very helpful, thanks for your time
@vani_4j
@vani_4j Жыл бұрын
in place of + ,we have *n. Does it make any difference??
@shivay5234
@shivay5234 Жыл бұрын
Yes
@shivay5234
@shivay5234 Жыл бұрын
a+b means either a or b and a*b means a followed by b.
@cricadic
@cricadic 10 ай бұрын
0* means keen closure of 0 i.e ε,0,00,000,0000,......................... 0+ means positive closure of 0 i.e 0,00,000,0000,.....................
@PawanRajput891r
@PawanRajput891r 8 ай бұрын
Thank u so much ma'am 😊
@yuvasairithviksajja5845
@yuvasairithviksajja5845 Жыл бұрын
Thank u madam
@sojalmehra2671
@sojalmehra2671 2 жыл бұрын
💯/💯
@farukeomar4354
@farukeomar4354 3 жыл бұрын
Much love
@prasath9289
@prasath9289 2 жыл бұрын
Worst explanation video from your entire playlist
@good-tn9sr
@good-tn9sr Жыл бұрын
ur mom
@studyhard-x1q
@studyhard-x1q Жыл бұрын
Y u rushing mam... Anything biting ur legs???Say some slowly mam...please
@socialmediauser9497
@socialmediauser9497 7 ай бұрын
Slower the speed and listen man
@arhammulla1639
@arhammulla1639 6 ай бұрын
What kind of language is this "biting your legs"!!?? When someone is teaching you they are your guru show some respect And if you are that slow fyi there is an option youtube provides to watch it at a slower speed I always watch in 2X tbh Don't know how this speed is fast for you
@Usadreamerok
@Usadreamerok 6 ай бұрын
​@@arhammulla1639why you mad😂😂
@arhammulla1639
@arhammulla1639 6 ай бұрын
@@Usadreamerok avein hi faltugiri karne mein maza aati hai mujhe
@Cyclopentasi_1oxane
@Cyclopentasi_1oxane 3 ай бұрын
Anything biting ur legs to get this much mad? Slow it urself
@Abhishek7Shah
@Abhishek7Shah Жыл бұрын
far better than my classteacher
@aditipatil9491
@aditipatil9491 Жыл бұрын
same
@ARIA-In
@ARIA-In 2 ай бұрын
You guys understood this 😢​@@aditipatil9491
@yosh6458
@yosh6458 23 сағат бұрын
This is far more understandable than lectures at my University. Thank you.
@vani_4j
@vani_4j Жыл бұрын
in place of + ,we have *. Does it make any difference??
@JoseSeverinoFerreiraBarboza
@JoseSeverinoFerreiraBarboza Жыл бұрын
+ is OR and * recursion
Theory of Computation: DPDA Example (wcw^r)
6:36
Anita R
Рет қаралды 118 М.
Непосредственно Каха: сумка
0:53
К-Media
Рет қаралды 12 МЛН
Theory of Computation: Turing Machine Problem - Palindrome
22:58
Theory of Computation: PDA Example (a^n b^2n)
7:52
Anita R
Рет қаралды 602 М.
Pushdown Automata Example - Even Palindrome (Part 1)
14:11
Neso Academy
Рет қаралды 959 М.
Theory of Computation: Conversion of CFG to PDA
18:21
Anita R
Рет қаралды 222 М.