Finite Automata to Right and Left Linear Grammar Practice Example || Lesson 48 || Finite Automata

แชร์
ฝัง
  • เผยแพร่เมื่อ 1 พ.ย. 2024

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

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

    Sir, I have a small doubt
    If we reverse the F.A ,Every non-final state will become final state na
    And in some cases you are applying epsilon on 0 and in some cases you aren't
    Could you please explain elimination of epsilon clearly?

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

      When we reverse.
      Initial state will be final and final will be initial.
      Not all non final states.
      Once watch reverse of a regular language video.
      Eliminating epsilon
      Go down in the playlist we have a separate video on eliminating epsilon.
      We can do either way.
      By eliminating epsilon and with out eliminating

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

      Eliminating epsilon is just substitute epsilon
      If A have epsilon production
      Substitute epsilon in place of A and write as one more new production