You’re a true legend in TOC. I will tell all of my friends to follow your lectures. You make problems explicit and solvable better than those I am paying to teach me at college. Thank you so much.
If I had studied it a couple of weeks before, I could've scored 2 more Marks in NET. Anyway, "girna nahi gir k samhalna hain zindegi" Thank you for this nice presentation as well as explanation.
The numerators are the input to the transfer functions, denoms are the outputs. Being able to cancel everything out means you're at the end state (from end state -> end state ~ means nowhere else to go). The hashes mean you're at the end of the input string?
Thanku so much my professorhas beentrying to make me understand this for 3 yeras now and this video has helped me understand in 10 secvonds thaku o much i lov youi want you
In the example 2 we have to use only domino 2 because 10111 and 10 but when I choose domino 1 mean 1 and 111 then there is no other go for 11 takes place.
UGC-NET DEC 2019 Let A={001,011,11,101} & B={01,111,111,010} similarly, Let C={00,001,1000} & D={0,11,011} Which of these pairs have a post-correspondence solution? The solution is: pair (A,B) only. Try to find the solution yourself.
You’re a true legend in TOC. I will tell all of my friends to follow your lectures. You make problems explicit and solvable better than those I am paying to teach me at college. Thank you so much.
habibi come to india
@@haariskhan961as if india has good teachers in colleges
THANK YOU! I learned more in your 14 minute lecture than a 1 hour lecture by my professor :D
Haters will say that this video is sponsored by Dominos’s Pizza!
You literally guaranteed me 25% on my final. Thanks!
If I had studied it a couple of weeks before, I could've scored 2 more Marks in NET. Anyway, "girna nahi gir k samhalna hain zindegi"
Thank you for this nice presentation as well as explanation.
The numerators are the input to the transfer functions, denoms are the outputs. Being able to cancel everything out means you're at the end state (from end state -> end state ~ means nowhere else to go). The hashes mean you're at the end of the input string?
Thanks! It helped. So it's not decidable, but it is recognizable, right?
Yeah
Thank you sir for this lecture , it surely benefitted me
Thanku so much my professorhas beentrying to make me understand this for 3 yeras now and this video has helped me understand in 10 secvonds thaku o much i lov youi want you
thanks for such amazing videos.the videos helped me a lot in my learning.
Thank you sir ... finally I understood pcp
Dhanyawad Guruji ❤❤❤❤❤
Thanks a lot sir. Explanation is very clear.
Teach -> RICE's Theorem
You really saved my life!
amazing tutorial! understood everything! thank you
Very nice explanation sir !!
In the example 2 we have to use only domino 2 because 10111 and 10 but when I choose domino 1 mean 1 and 111 then there is no other go for 11 takes place.
Thanks a lot Neso Academy
Nice explanation sir 🙌
Best explanation 🤩🤩👌🏻👌🏻
Thanks great video
Thanks
Is it necessary to use all the dominos while coming to final PCP solution?
Sis you got answer for this ? Should we include all dominos to get ans ?
@@godfather_007 it's not necessary.
is thir any rule do we need use all dominos can we take only few of them
Same doubt bro ? You got answer now ? Should we include all dominos to get answer ?
Great!
What if two dominos have first two same numerator and denominator
It is the same
How the question will be asked in this particular PCP problems and how to convert the question to above example ....tell me
UGC-NET DEC 2019
Let A={001,011,11,101} & B={01,111,111,010} similarly, Let C={00,001,1000} & D={0,11,011}
Which of these pairs have a post-correspondence solution?
The solution is: pair (A,B) only. Try to find the solution yourself.
Hi, can u help me to solve a pcp now? kindly let me know
Obviously…I know i…u r so beautiful 😍😘
W vid