Section outline

  • 1.       Non deterministic Finite Automata definition

    2.       Formal Definition

    3.       String Acceptance

    4.       NFA Construction

    • resource icon
      NFA Construction File
    • url icon
      Lecture Video [Google Meet] URL
    • assign icon
      Task on NFA Construction Section A Assignment
      Opened: Saturday, 28 December 2024, 11:30 AM
      Due: Monday, 30 December 2024, 12:00 AM
      Students must
      View
      Make a submission

      Give state diagrams of NFAs with the specified number of states recognizing each of the following languages. In all parts, the alphabet is {0,1}.

      a. The language {w| w ends with 00}

      b. {w| w contains the substring 0101 (i.e., w = x0101y for some x and y)}

      c. {w| w begins with a 1 and ends with a 0}

      d. {w| w begins with substring 1101}

    • assign icon
      NFA exercise Assignment
      Opened: Sunday, 6 October 2024, 12:00 AM
      Due: Monday, 7 October 2024, 2:30 PM
      Students must
      Mark as done

      Submission deadline: 3rd October, 22

      Time: 2:30 PM