Theory of Computation: Turing Machine Problem - Concatenation

แชร์
ฝัง
  • เผยแพร่เมื่อ 9 ก.พ. 2025

ความคิดเห็น • 7

  • @processing34
    @processing34 2 ปีที่แล้ว +4

    Really these lectures are wonderful and beneficial for us. Thanks for uploading this video.

  • @nithiyashrees.280
    @nithiyashrees.280 2 ปีที่แล้ว +1

    Thankyou so much ma'am.very much helpful

  • @k.abhijeet
    @k.abhijeet 3 ปีที่แล้ว +4

    Is this same as TM for addition of 2 numbers?

  • @keerthanak6022
    @keerthanak6022 4 ปีที่แล้ว +1

    Mam, could u plz solve more problems on npda and dpda mam plz....
    U explain really well mam!!!

  • @fritz6600
    @fritz6600 2 ปีที่แล้ว

    Why isn't B (Blank) a part of the input symbol? Input symbols are those which are given for the state transition right, if that's the case then we ARE providing B to transition between q1 to q2, so?

    • @relaxationvibs
      @relaxationvibs 2 ปีที่แล้ว

      and we can skip blank right ? instead of changing them into 0, skip them and change the state to final if it reaches blank.

  • @kk85-unc
    @kk85-unc 2 หลายเดือนก่อน

    This is basically UNIARY ADDITION