Your Turing Machine videos are very easy to understand. I really like the part where you explain what states that we need, and what symbols will be skipped. It really makes it easier to design/understand any TM. Thank you very much!
Great tutorial! As a person who is struggling with turing machines, this tutorial offers a user-friendly approach and it made me learn a lot in solving turing machine problems
It doesn't work for abc; the string is successfully changed to XYZ, but there's no transition from q3 for the Blank symbol. It doesn't work for aabbcc, neither; the first abc is successfully changed and the string on the tape is XaYbZc But, it's in the state q3 and it stops because there's no transition if it finds a c. Added these two missing transitions, it works.
Your Turing Machine videos are very easy to understand. I really like the part where you explain what states that we need, and what symbols will be skipped. It really makes it easier to design/understand any TM. Thank you very much!
happy you! me no understand a bit! jjjj
Very neat explanation , easy to understand . This vedio helped me in ma exam .Thank you
Great tutorial! As a person who is struggling with turing machines, this tutorial offers a user-friendly approach and it made me learn a lot in solving turing machine problems
I love u , I looked at this 20 mins before my exam and the exact question came up but as 001122
Thanku so Much sir. Your explanation is excellent
Nice explanation ever Thanks From Kerala
Thank you so much. This helped me a lot. Great explaination
The last transition should not be the right move, it will be the left move. The right move makes you out from the linear boundary.
This is a great video thank you for your help!
Background music is so annoying
Very nice explanations. Thank you sir
Very easy explanation
If n>=0 .... Will the solution remain same ???
on point and great work!!!
Thank you, very helpful.
¡Muchas Gracias!
what happens if n>=0?
explanation 👌🏻👌🏻
What's this all about?
thankyou very much
tq soooooo much sir
but i am looking that the string abc is not allowed here...please....correct me if i am wrong
good explaination
The strings that will be accepted by language L = {0^3^n+1 : n ≥ 0}, if n = (0,1,2)
how to solve above problem.
Excellent
It doesn't work for abc; the string is successfully changed to XYZ, but there's no transition from q3 for the Blank symbol.
It doesn't work for aabbcc, neither; the first abc is successfully changed and the string on the tape is XaYbZc
But, it's in the state q3 and it stops because there's no transition if it finds a c.
Added these two missing transitions, it works.
Thanx sir ji
back ground music ko banda karo
In spanish plox
Mi a faszom az az állapot?