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

Поділитися
Вставка
  • Опубліковано 29 вер 2024

КОМЕНТАРІ • 27

  • @senceryucel8581
    @senceryucel8581 2 роки тому +32

    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

  • @JamesBiser
    @JamesBiser 3 дні тому

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

  • @gkhnyasinkaya
    @gkhnyasinkaya Рік тому +5

    haketmiyosun bu kadar az beğeniyi reis.

  • @user-ve2xt8cj9t
    @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}

  • @charliestarn9581
    @charliestarn9581 Рік тому +9

    Wouldn't your machine recognize "aabbccaabbcc"?

    • @ROYBOY322
      @ROYBOY322 10 місяців тому +3

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

    • @smoulibabca
      @smoulibabca 8 місяців тому +3

      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
      @shmug8363 4 місяці тому

      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

  • @brendawilliams8062
    @brendawilliams8062 11 днів тому

    A very helpful and appreciated video. Thankyou

  • @karanyadav7838
    @karanyadav7838 Рік тому +4

    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?

  • @zecabau
    @zecabau 2 роки тому +1

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

  • @ibrahimaltawil121
    @ibrahimaltawil121 Рік тому +1

    i love you

  • @可惜前
    @可惜前 2 роки тому +1

    Very clear! Thank you!

  • @kin_1997
    @kin_1997 5 місяців тому

    thank you so much for the video

  • @Ayesha-uw4dt
    @Ayesha-uw4dt 6 місяців тому

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

  • @tranvuong3273
    @tranvuong3273 6 місяців тому

    nice explanation. tysm!!!

  • @bushraw66
    @bushraw66 Рік тому

    man your explanation is perfect

  • @almogpatashnik3238
    @almogpatashnik3238 Рік тому +1

    Thank you!

    • @almogpatashnik3238
      @almogpatashnik3238 Рік тому

      Is the string abcabc not being accepted as well?

    • @luisao2770
      @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.

  • @matheusaugustodasilvasanto3171
    @matheusaugustodasilvasanto3171 2 роки тому

    Great vid!

  • @kryt_8582
    @kryt_8582 2 роки тому

    very helpful thank you