28. chomsky hierarchy part2

Поділитися
Вставка

КОМЕНТАРІ •

  • @PIYUSHSHARMA-ql3uz
    @PIYUSHSHARMA-ql3uz 5 місяців тому +1

    20:26 23:14 30:00

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

    TOC padhne me itna maja aa raha hai ki dusra subject dekhne ka maan hi nahi karta ...
    Aur bhale hi videos ek ghante kr upar ke hai , par lagata hi nahi ki kab ek ghante nikal gaya..
    Amazing lecture sir ❤
    #gategod

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

    Sir you are the best of all teachers I have watched your complete playlists of dbms, discrete math, toc and specially computer networks and gained so much confidence only because of you many of us without joining institutes could crack GATE exam you are the best❤❤❤❤

  • @future8060
    @future8060 2 роки тому +6

    Sir Etna deep mai to PHD mai bhe nahi nahi learn kar payenge

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

    sir you told that type 3 can be said as subset of linear grammer, but S->epsilon can't be in linear as there is no nonterminal in right hand side

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

      bro S is start symbol what if u want to generate null string from start !!?? even in T1 grammars null productions are not allowed still S->Epsilon was allowed with restriction
      and again if u want to construct an G for L={epsilon} S->Epsilon/aD/bD D->aD/bD this is my regular grammar we make initial as final and for that we need to put epsilon, when my language contains Null then S->Epsilon is mandatory even after removal of all null productions
      And the defination of Linear Grammar says that ATMOST 1 NT in RHS means 0 or 1 NT in rhs and any number of terminal in RHS so definately S->Epsilon is linear grammar
      to be more specific RHS or Linear grammar can be **/*

    • @hero23980
      @hero23980 22 дні тому

      Linear grammer contains at most one non terminal in the RHS

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

    Thanks❤️🙏

  • @pawanchoure1289
    @pawanchoure1289 2 роки тому +2

    nice👍👏👏

  • @kaatilbilla1202
    @kaatilbilla1202 3 роки тому +1

    Hello sir, december se pehle TOC ho jayega poora? Thanks for the lecture

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

    Sir @18:31 B->aB/Null. then how B->Null is type 3 grammar...bez it is not type 1 grammar as length of LHS is not less than or equal to length of RHS.

    • @jigarjoshi9198
      @jigarjoshi9198 2 роки тому +2

      that's the point

    • @grasshopper005
      @grasshopper005 2 роки тому +2

      bro type 3 supports null production, because it has mechanism to remove it anyway.

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

      ​@@grasshopper005 but bro for type 3 , first it must be type 0, type 1, type 2. and it is not type 1

    • @_strangelet__
      @_strangelet__ Рік тому +7

      @@prashantbhardwaj1988 yes, but null productions are an exception as sir told in his previous video. Null productions are allowed in type 2 and 3, because they can be removed with the help of an algorithm, but they are not allowed in type 1 since there is no algorithm which can remove null productions from type 1.