4.13. DFA for divisibility in binary by 4

แชร์
ฝัง
  • เผยแพร่เมื่อ 3 มี.ค. 2019
  • Technical lectures by Shravan Kumar Manthri.
    Watch Top 100 C MCQ's
    • Top 100 MCQs in C ("Wa...
    Watch Technical C programming
    • Technical C coding : p...
    Watch Data Warehousing & Data Mining
    • 1. Multi-Dimensional ...
    Watch Design & Analysis of Algorithms
    • 1. Introduction to the...
    Watch Formal Languages & Automata theory
    • 1. Introduction to Aut...
    Contact me @ fb : shravan.kites@gmail.com
    Like us on fb: CSE GURUS
    This video explains DFA problems with explanation. #ShravankumarManthri#CSEGURUS #ShravankumarManthri#CSEGURUS

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

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

    since it is a DFA it shouldn't be incomplete right? otherwise it is NFA. Tha graph here however looks to be incomplete, hence not DFA imo?

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

    for q2, it should head to q0 when it gets a 0 right that would be 4 -- 100

  • @ashishj9497
    @ashishj9497 4 หลายเดือนก่อน

    nice method

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

    Loved the approach! Thank you for such a clear explanation!

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

      Glad you enjoyed it...Watch Turing Machine problems in the following link
      www.udemy.com/course/formal-languages-and-automata-theory/learn/lecture/17998421?

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

    how to draw for not divisible by 4

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

      Idk

  • @dreamer1777
    @dreamer1777 6 หลายเดือนก่อน

    3:57 sir could you please answer me how 6 remainder 2,and 7 remaider is 3?

    • @devedits19
      @devedits19 6 หลายเดือนก่อน

      6%4=2
      Four goes 1 time and 2 left
      Same for 7%4=3
      Four goes 1 time and 3 left

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

    1:51 bro..we get 2 as reminder when 1 is divided by 4?? then how these transition is possible?

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

    Thank you

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

      You're welcome..Watch Turing Machine problems in the following link
      www.udemy.com/course/formal-languages-and-automata-theory/learn/lecture/17998421?

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

    Great, thanks

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

      Most welcome...
      Watch Turing Machine problems in the following link www.udemy.com/course/formal-languages-and-automata-theory/learn/lecture/17998421?

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

    👍

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

      Watch Turing Machine problems in the following link
      www.udemy.com/course/formal-languages-and-automata-theory/learn/lecture/17998421?

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

    But this DFA is also accepting empty string e, which is not divisible by 4, please explain

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

      empty string means length is 0. so 0 is divisible by 4. right?

    • @Ajeet-Yadav-IIITD
      @Ajeet-Yadav-IIITD 3 ปีที่แล้ว

      @@CSEGURUS Nope, here divisibility by 4 is not checked on length of string, it's on decimal value of Binary representation of strings.
      Empty string doesn't have any decimal value and hence it should not be accepted by the DFA.

    • @Ajeet-Yadav-IIITD
      @Ajeet-Yadav-IIITD 3 ปีที่แล้ว

      @@CSEGURUS d(q0, 0)=*q1 (final state)
      d(q1, 1) =q2
      d(q1, 0) = *q1 (final state)
      d(q1, 1) = q2
      d(q2, 0) = q1
      d(q2, 1) =q2
      This should be the correct DFA, it rejects the empty String

    • @sakshishinde9337
      @sakshishinde9337 10 หลายเดือนก่อน

      ​@@Ajeet-Yadav-IIITDwhere the q0 is going for 1