Operations on Regular Languages

Поділитися
Вставка
  • Опубліковано 29 гру 2024

КОМЕНТАРІ • 138

  • @starzone9843
    @starzone9843 5 років тому +219

    Sir, i am binge watching your videos.. i have already watched 14 of them, your way of explanation beats our professors. Keep it up 👍🏻👍🏻👍🏻👍🏻 big fan👍🏻

    • @marxman1010
      @marxman1010 3 роки тому +4

      Better than other automata online courses, surprisingly articulate.

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

      ​@Radar123 to 🔥

    • @kartikforwork
      @kartikforwork Рік тому +2

      but this is 9th feku

    • @prashantpaliwal2286
      @prashantpaliwal2286 Рік тому +9

      Thanks man, along with automata i am also improving my grammar or vocab from comment section. Today I learned the word -
      binge-watching.

    • @captainstark5496
      @captainstark5496 10 місяців тому

      This teacher's professor is my professor

  • @Furious_footballs
    @Furious_footballs 9 місяців тому +9

    Surely I will donate some money that I could afford when I get my first month salary........Hats off for your sincere hard work and this is my first comment on UA-cam.

  • @shariquatkhan
    @shariquatkhan 7 років тому +88

    I wish you were my college automata teacher😍 Taught so well. Thank you☺

  • @ThePhlox99
    @ThePhlox99 5 років тому +101

    Theorem: The class of regular languages is closed under union and intersection. That
    is, if L1 and L2 are regular languages, the so are L1 ∪ L2 and L1 ∩ L2.
    Proof Lets start with the union. For simplicity, let us assume that L1 and L2
    are languages over the same alphabet Σ.
    Since L1 is regular, there exists a DFA
    M1 = (Q1, Σ, δ1, q1, F1) which recognizes L1.
    Similarly, there exists a DFA M2 =
    (Q2, Σ, δ2, q2, F2) which recognizes L2.
    To prove that L1∪L2 is regular, we will construct a DFA M∪ which recognizes L1∪L2 =
    {w|w ∈ L1 or w ∈ L2}.
    The idea: M∪ = (Q, Σ, δ, q0, F) simulates a parallel execution of M1 and M2. M∪ is
    defined as follows:
    - Q = Q1 × Q2;
    - Σ is the same;
    - δ((q1, q2), a) = (δ(q1, a), δ(q2, a));
    - q0 = (q1, q2);
    - F = {(r1, r2) | r1 ∈ F1 or r2 ∈ F2}
    To prove correctness we need to show that w ∈ L1 ∪ L2 if and only if M∪ accepts w.
    This, in turn, follows from the fact that (r0, r1, . . . , rn) is a computation of M1 on w, and
    (t0, t1, . . . , tn) is a computation of M2 on w, if and only if ((r0, t0),(r1, t1), . . . ,(rn, tn))
    is a computation of M∪ on w.

  • @MSneberger
    @MSneberger 6 років тому +22

    For proof that Regular Languages are closed under Union Operation see Theorem 1.25 on page 45 of Sipser's textbook. For proof that Regular Languages are closed under Concatenation Operation see Theorem 1.26 of Sipser's textbook on page 47.

    • @alan2211
      @alan2211 5 років тому +1

      Sipser no make sense.

  • @yt_souvik
    @yt_souvik 2 роки тому +8

    I finished this lecture just now. Please upload those two theorem proofs in Another video, it will be helpful for us.

  • @omkarmarbhal
    @omkarmarbhal 8 років тому +4

    Best Tuts Ever........!!!!

  • @kasozivincent107
    @kasozivincent107 4 роки тому +7

    Hello. I think u messed up the Kleene star operation. It is not just a concatenation of all elements of A. It contains strings of 0 lengths, 1, 2, and so on. So I guess they should even be separated by commas. I suggest it would be better to use union notation. A mathematical definition would suffix for this, if L = {a,b}, L* = {@, a, b, aa, ab, ba, bb, aaa, ...} not just a concatenation of symbols from the alphabet that L is defined. {bbabababbabaabababa} for example is just an element of L*

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

    Thank you for the content, as always. Very easy to follow and understand

  • @ChoralMasterPiece15
    @ChoralMasterPiece15 11 місяців тому +1

    please upload a video on proofs of the theorms at last

  • @AnonymousDeveloper1
    @AnonymousDeveloper1 8 років тому +18

    Hello, question not specific to current subject but I must ask you:
    Will you record data structures and algorithms tutorial series in the future?

    • @AnonymousDeveloper1
      @AnonymousDeveloper1 8 років тому +5

      Wow, nice! I would like to see this series because you are great.

    • @shivamdubey7599
      @shivamdubey7599 7 років тому +3

      Please bring up the algorithm part as quick as you can. It would be very kind of you.

    • @Aba9846
      @Aba9846 6 років тому +1

      Awesome! Where can we find these videos?

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

    Your videos pretty great SIR ..😃
    Guy's do follow this channel is very useful to gain knowledge easily...
    👍👍

  • @roshannalawade7389
    @roshannalawade7389 8 років тому +59

    sir give me the proof of this

  • @girlforyoru
    @girlforyoru 2 роки тому

    Thank you Neso Academy I watched some of FSM videos are very Interesting and Entertain to Learn for my Computer Science Career! Cheers UP

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

    Thank you so much to explaining us 😍😍

  • @diptamanguha155
    @diptamanguha155 7 років тому +8

    Sir..your videos are great.These helped me a lot.Will it be possible for you to upload videos on C programming,data structures and algorithm?

  • @gedelasivakrishna
    @gedelasivakrishna 2 місяці тому +1

    Thankyou !!

  • @sasswithdivyanshi
    @sasswithdivyanshi 4 роки тому +3

    This is so well explained ❤️❤️❤️❤️❤️❤️❤️

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

    for proof of the following theorems I will use the fact that regular languages are those that can be described by regular expression, let's say we have 2 regular languages A and B, and their regex be p and q, then concatenation of those languages can be described by pq (first part will describe string from A and second part string from B), as for union we can use | operator for regular expressions and describe language by (p | q) since union contains strings that are present in both languages.

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

    Id like proofs of those 2 theorems please. Thank you for this video as well sir!!!

  • @fcreany9147
    @fcreany9147 5 років тому +3

    Should the AUB and A•B included the Epsilon ?
    Such that
    AUB ={ε,pq ,r,t,uv}
    A•B={pqt,pquv,rt,ruv, ε,pq(=pqε) ,r,u,t}

    • @NSHAIKAMEENA
      @NSHAIKAMEENA 4 роки тому

      No

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

      For anyone wondering about this in the future, and to be more helpful than just "No", only A* can contain epsilon because in the definition it says there are k elements of A where k can be any positive number including zero. k being zero is how you get epsilon aka no elements at all.

  • @adiyc2909
    @adiyc2909 4 роки тому +3

    Thank you ,sir . Very easily understandable . But can you please provide the proofs of the theorems also ?

  • @Ana-el3gk
    @Ana-el3gk 4 роки тому +1

    Amazing! thank you

  • @jeetdas4799
    @jeetdas4799 7 років тому +1

    Helps me alot....tnk u sir ji

  • @divyaagarwal3091
    @divyaagarwal3091 2 роки тому

    Thank you so much sir

  • @jaiashutosh2181
    @jaiashutosh2181 10 місяців тому +1

    for union purpose dont you think we should mention and like x belongs to a and x belongs to b. please correct me if i am wrong.

  • @Kshirabdi.Tanaya
    @Kshirabdi.Tanaya 2 роки тому +1

    Sir please make a video on theorems.🙏🏻

  • @technicalinfochannel66
    @technicalinfochannel66 5 років тому +2

    dear sir kindly explain the theorem of class of regular language is closed under the "kalena" star operation

    • @aydict
      @aydict 5 років тому

      kleene*

  • @dillipkumarsahoo5017
    @dillipkumarsahoo5017 2 роки тому

    Sir please make a video of proving the
    all theorems of regular languages

  • @pushplataraina51
    @pushplataraina51 7 років тому +10

    hi sir,
    i want
    proof of theorems

  • @saidurgaprasad5172
    @saidurgaprasad5172 2 роки тому

    Thanks you sir

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

    Sir predicted "RRR" Film before it was a thing...

  • @shivrajkhose7875
    @shivrajkhose7875 7 років тому +1

    please upload videos of turing machine,recursive and recursively enumerable language

  • @jsbbatth8667
    @jsbbatth8667 3 роки тому

    Please make a video on proof of the theorems

  • @rohitpandey4
    @rohitpandey4 3 роки тому

    Sure sir can you make a video for Proof of Theorem1 and Theorem2

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

    Love from muzaffer garh Pakistan

  • @trywellwashington7506
    @trywellwashington7506 4 роки тому +1

    concatenation: cartesian prod, order of elements in pair immaterial

  • @ankitjain2398
    @ankitjain2398 6 років тому +3

    Sir please record videos on Computer Networks of CS branch

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

    Union, Concatenation & star.

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

    The star one is also called kleen closure .

  • @apporvaarya
    @apporvaarya 5 років тому

    nice concept

  • @satwikyalamarthi1162
    @satwikyalamarthi1162 7 років тому +15

    We want proof...... Can you please explain

  • @dhanushsivajaya1356
    @dhanushsivajaya1356 4 роки тому

    Thankyou sir

  • @adhishagammanpila
    @adhishagammanpila 6 років тому

    Really appreciate if you could do the proof too

  • @AhamedKabeer-wn1jb
    @AhamedKabeer-wn1jb 4 роки тому

    THANK YOU..

  • @akshunkc6884
    @akshunkc6884 7 років тому +4

    hi sir nice TOC series...plz also upload profs of these theorems...?
    thanks in advance...

  • @anirudhyasarkhel8247
    @anirudhyasarkhel8247 6 років тому +4

    Sir please provide proof for those 2 theorems, imp for exam

  • @sathirajumadhavarapu3065
    @sathirajumadhavarapu3065 5 років тому +2

    sir, could you please explain proof of two theorems

  • @chandanpatra3850
    @chandanpatra3850 7 років тому +1

    sir can I use this answer for closure properties of regular sets.

  • @shinigamiryuk4183
    @shinigamiryuk4183 3 роки тому

    my teacher plays your videos in lectures

  • @uditisinha357
    @uditisinha357 2 роки тому

    what is the significance of putting k => 0 for A*?

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

    Level 9 reached @!

  • @richierabbit2733
    @richierabbit2733 7 років тому +1

    please please make vedios on data structures

  • @Ankit-we8ym
    @Ankit-we8ym 8 років тому +2

    dear sir are you also teaching any other subjects for cse students

  • @knvssandeepbolisetti5008
    @knvssandeepbolisetti5008 6 років тому +3

    Sir pls give the proof for theorems

  • @Uttamkeshri726
    @Uttamkeshri726 4 роки тому

    In A* prq also be there

  • @Montserratx
    @Montserratx 4 роки тому

    Can you explain to me this example, please?
    A*={a*,b*,a*,b*}

  • @imhsk1037
    @imhsk1037 5 років тому

    pls clarify our doubts

  • @teenanandwani8823
    @teenanandwani8823 6 років тому

    Sir please explain Kleen's theorem...

  • @risingsingh3424
    @risingsingh3424 5 років тому +1

    How to visualise practically the concept of regular languages

  • @kishankanabar6620
    @kishankanabar6620 6 років тому

    sir i can find one ambiguity over here.When you are declaring definition of star,i.e. A*={x1x2x3...xk:k>=0 and all xi belongs to A}.So when k=0,what would be the concatenating string?and if you are saying it is a null string then again ambiguity arise because as you said all xi,including x0 should belong to A,but that is not in the actual case.Please make it clear.

    • @vivekkumar-xc8vq
      @vivekkumar-xc8vq 6 років тому

      Kishan Kanabar Hey... Are you not aware of the fact that all sets have a null element i.e. null element belongs to each and every set....

  • @moazzamali5995
    @moazzamali5995 4 роки тому

    Sir plz..show some prove. Of this theorem

  • @UniversalUnicorn
    @UniversalUnicorn 9 місяців тому

    5:35/5:57 : 🦭🦭

  • @RNCSSakshamBhatia
    @RNCSSakshamBhatia 3 роки тому

    If possible please give the proof of theorems.

  • @saptarshiroy3943
    @saptarshiroy3943 2 роки тому

    Sir, can you provide the proof of Regular language expression?

  • @durgarajeswaritalluri4124
    @durgarajeswaritalluri4124 5 років тому +1

    sir will pqpqr is also in A* ??

  • @fizzsfizz7617
    @fizzsfizz7617 6 років тому

    Video was awesome but You should provide proof to complete topic

  • @CyrusXIII
    @CyrusXIII 3 роки тому

    Thank you :)

    • @shankarreddy4674
      @shankarreddy4674 3 роки тому

      What is it mean every one commenting like this

  • @ronikseth6742
    @ronikseth6742 6 років тому

    sir i want regular language's many types of problem with solution for better understand.thank you.

  • @gajulanagamani8312
    @gajulanagamani8312 5 років тому

    sir explaine the proof about two theorems

  • @akshaykhachi8565
    @akshaykhachi8565 4 роки тому

    If L={ab, c}...what will be L^3....??

  • @ishmitabasu9623
    @ishmitabasu9623 6 років тому

    Can i please get a proof of the two theoram?

  • @saraswatibepari8233
    @saraswatibepari8233 3 роки тому

    Sir , give us the prove of this 2 theorem ... please

  • @nebiyumesfin9620
    @nebiyumesfin9620 4 роки тому

    Set of regular languages over a given alphabet is not closed under
    a) union b) complementation
    c) intersection d) none of the above

  • @bhishmapitamah3681
    @bhishmapitamah3681 3 роки тому

    5:52 your device is fine

  • @thirumenipharma2612
    @thirumenipharma2612 3 роки тому

    what about (A+B)*

  • @ashisraha9263
    @ashisraha9263 2 роки тому

    Sir I need proves of two theorem of regular languages. If you send me then I will be thankful to you.

  • @VikashSingh-sq2yy
    @VikashSingh-sq2yy 3 роки тому

    Sir please give the proof of the theorem.

  • @sambhavjain9382
    @sambhavjain9382 5 років тому

    can we have the proofs please?

  • @barathkumarsr9890
    @barathkumarsr9890 3 роки тому

    Please prove the theorem 1& 2 sir

  • @continnum_radhe-radhe
    @continnum_radhe-radhe Рік тому +1

    ❤❤❤

  • @pedarayududola1672
    @pedarayududola1672 6 років тому

    what is regular language

  • @laxmiwodeyar3113
    @laxmiwodeyar3113 6 років тому

    Sir please do proo

  • @shaganpreetkaur1397
    @shaganpreetkaur1397 7 років тому

    thermos of regular languages expain sir

  • @pranaysahariah6193
    @pranaysahariah6193 5 років тому

    Proof of the therom sir pls

  • @msm8416
    @msm8416 6 років тому

    Proof for Theorem 1,Theorem 2 plz

  • @naveenraju3540
    @naveenraju3540 4 роки тому

    sir proofs please

  • @vlogsnepal9550
    @vlogsnepal9550 6 років тому

    sir proof please on union operation

  • @SanjeevKumar-td4bj
    @SanjeevKumar-td4bj 6 років тому

    sir please upload proof of this video

  • @vishalsaxena4869
    @vishalsaxena4869 7 років тому +4

    need proof

  • @sanathramesh7254
    @sanathramesh7254 6 років тому

    Proof please

  • @15tefera
    @15tefera 6 років тому

    Sir, I want bob please

  • @saideep9808
    @saideep9808 4 роки тому

    sir we want proof

  • @khushiahuja82
    @khushiahuja82 8 місяців тому

    sir bta do proof!!!!

  • @swadheenta.957VBTS
    @swadheenta.957VBTS 5 місяців тому

    💜💜

  • @sudiptacoachingcentre4118
    @sudiptacoachingcentre4118 2 роки тому

    Want the proof

  • @USBEN.
    @USBEN. 5 років тому +1

    Theorm : Stating the obvious facts with fancy english .

  • @DnyaneshwarPanchaldsp
    @DnyaneshwarPanchaldsp 5 років тому

    💐💐💐💐👌

  • @addagallanaresh4044
    @addagallanaresh4044 2 роки тому

    Want proof

  • @dqfans3364
    @dqfans3364 2 місяці тому

    prooof