Saturday, July 20, 2019

CS402 (Theory of Automata) Assignment No. 3 Solution Spring 2019

  • HTML

    • Please Discuss here about this assignment.Thanks
    Our main purpose here discussion not just Solution
    We are here with you hands in hands to facilitate your learning and do not appreciate the idea of copying or replicating solutions. Read More>>
    Discussed & be touched with this discussion. After discussion a perfect solution will come in a result at the end.

    “

    Share below link with friends for solution & Discussion. A Single link for help in your education.
    on

    2 comments:

    1. SAFAJuly 20, 2019 at 5:23 AM

      Solution:



      L1= language of words having triple a’s.



      The regular expression L1 is as below

      R.E = (a+b)* (aaa) (a+b)*



      L2= language of words containing ab.

      The regular expression L2 is as below

      RE = (a+b)* (ab) (a+b)*



      Using De-Morgan’s law for sets

      (L1C U L2C)C = (L1C)C ∩ (L2C)C = L1 ∩ L2

      Please check RE of L1 and L2 is correct.

      ReplyDelete
    2. UnknownJuly 20, 2019 at 9:42 AM

      yeh just itna solution h kya is k FAs nhiu hn kya???

      ReplyDelete

    Subscribe to: Post Comments (Atom)