Turing Machine Example: a^n b^n c^n

[@senceryucel8581]

You should be beyond reality. There is no way for someone in universe to have that much ability to teach. Even though I am going to pass my theory of computation course in 3 weeks, I will keep tracking your videos because of the interest you have created in me to this course. Thank you for everything. I really am grateful for everything you have taught. Once I got into a job and earn my own money, I am going to donate as many amount as possible to this channel. Huge thanks from Turkey. Love you

[@Cruizzerr]

Did you get a job?

[@brendawilliams8062]

It’s wonderful isn’t it

[@JamesBiser]

Dude, please teach at Penn State. For the love of God, they need people like you.

[@gone3394]

Haha the teachers there are terrible for the most part I had to transfer because I couldn’t justify the price for the materiao

[@Ayesha-uw4dt]

your videos on this topic are so good!!! ty!!

[@YassineKESSAL]

thank you my friend u made it so easy

[@bushraw66]

man your explanation is perfect

[@brendawilliams8062]

A very helpful and appreciated video. Thankyou

[@可惜前]

Very clear! Thank you!

[@gkhnyasinkaya]

haketmiyosun bu kadar az beğeniyi reis.

[@artianrika8329]

Thank you very much

[@karanyadav7838]

Would this not be easier if instead of using duplicate X's, you use x,y, and z for the marked a's b's and c's?

[@miguelnuno928]

true

[@Kerreber]

It’s not necessary to use other than X

[@almogpatashnik3238]

Thank you!

[@almogpatashnik3238]

Is the string abcabc not being accepted as well?

[@luisao2770]

@@almogpatashnik3238 i think it is even tho it shouldn't because it looks for the next element until it hits an a or blank, in that case it will hit an a first. i recon the "go back" should be splitted in two to verify if to the right side is found a's or b's instead of "c's" and blanks. if it hits blanks go back if it doesnt call it a "trash state". i might be wrong tho.

[@YassineKESSAL]

u are a genius

[@tranvuong2906]

nice explanation. tysm!!!

[@kin_1997]

thank you so much for the video

[@matheusaugustodasilvasanto3171]

Great vid!

[@zecabau]

very helpfully ty! it would be cool if you did something like this with a multi tape machine :)

[@rewlette]

THISS

[@charliestarn9581]

Wouldn't your machine recognize "aabbccaabbcc"?

[@Royboy322]

Yep, came across this problem. It accepts abcabc, which is not in the language.

[@smoulibabca]

True, to solve it you could skip through all c´s until you hit empty symbol at the end and only then go back

[@shmug8363]

In an actual question, the input conditions are usually specified from my experience. So this questions input conditions would be some amount of as, followed by some amount of bs, followed by some amount of c's

[@YassineKESSAL]

is is really easy theory with u

[@user-ve2xt8cj9t]

Your machine recognize this language: {w contains an equal number of a's, b's and c's} not this {a^nb^nc^n: n≥0}

[@ibrahimaltawil121]

i love you

[@kryt_8582]

very helpful thank you