Biçimsel Diller Ve Otomata Teorisi - Turing Makinesi (TM) Konu - 6

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

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

  • @maltntas5585
    @maltntas5585 3 ปีที่แล้ว +3

    Bu konuyla alakalı örnekleri en anlaşılır anlatan bir tek size rastladım.Emeğiniz çok değerli.Sağolun.

  • @yuske101
    @yuske101 ปีที่แล้ว +3

    Thaks for sharing to you but ı wish your fonts would be more clear for who little see like me.

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

    1:09:13 de nasıl 1 e geliyorsun ben o kısmı anlamadım 1 e gelmek için 2 defa daha 0/y,R statelerini geçmen gerekmiyor mu ?

  • @eminekul4231
    @eminekul4231 ปีที่แล้ว

    çok güzel bir çalışma olmuş ellerinize sağlık.

  • @yusuft.3587
    @yusuft.3587 ปีที่แล้ว +1

    decidabilty, reducibility, complexity, NP ve P classları gibi konuları biliyor musun?

  • @yusuft.3587
    @yusuft.3587 ปีที่แล้ว

    emeklerin için teşekkür ederim

  • @yunusdogan9209
    @yunusdogan9209 3 ปีที่แล้ว +1

    cok güzel anlatım. helal olsun

  • @sansisalvo6770
    @sansisalvo6770 ปีที่แล้ว

    Kral adamsın

  • @michaelwittmann4774
    @michaelwittmann4774 3 ปีที่แล้ว

    eline sağlık hocam sayende finalde rahatladim çok teşekkürler

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

    😊😊😊