A lab consultant who can help with C251 questions is in LF105 or LF111.

See: www.ius.edu/rwisman/lab for current schedule.

Contact me by email with any questions. I can also usually arrange to meet on campus.

Options:

1. Bring a handwritten homework to class on due date.
    
2. Email Word document HW12.doc to instructor by 13:00 on due date.

Note:

• Draw Figures by Hand
  • Scan in hand drawn figures
  • If you are are able to cut and paste the scanned in figure into your Word .doc, then do so.
  • If you are not able to cut and paste the scanned in figure into your Word .doc
• Draw Figures Using a Drawing Software Package
  • Copy and paste electronically generated figures into your Word .doc.

• Section 12.1 -- pp. 793
  • 4
  • 14a, b, c   

    For c, note that string 0 is in the language.

  • 24
• Section 12.2 -- pp. 802
  • 2a
  • 4a, b
  • Construct a finite state machine that determines whether your initials have been read as the last 3 (or 2, 4, etc.) characters in the input so far, where the input can be any string in the English language.

    Similar to 19.

     

• Section 12.3 -- pp. 814
  • 10
  • 12
  • 16    Hint: Form union of the different paths to the final state. See 21 for example.
  • 20
  • 24
  • 28
• Section 12.4 -- pp. 825
  • 4
  • 6
  • 14b    Use Example 4 from class notes as a guide.
    
              Hint: Each of the 3 symbols: S, A, B, must have a state, and the must be a final state, a total of 4 states.
     
  • Regular expressions:

    Write a regular expression that recognizes valid trains constructed by:

    e - engine, one or more engines at the start of the train.

    b - box car, only come in pairs.

    p - passenger car.

    d - dining car, must follow 1-4 passenger cars.

    c - caboose, only one at the end of the train.

    Some examples of valid trains are:

    ec - the smallest valid train

    ebbc

    eppdc

    eeeebbbbppppdbbppdbbpdc

    Test using class notes regular expression analyzer.