CSci 3501 Algorithms and Computability - Lab 7.

October 14. Due Thursday, October 23 at 11:59pm

What to submit and when:

Lab assignment

Work in pairs

Lab overview and goals

The goal of the lab is to explore combining finite automata, contstructing NFAs, and converting NFAs into DFAs. You will use the JFLAP convert to DFA option.

Lab tasks

Unless specified otherwise, the alphabet is the set of 0 and 1.

Please design the following finite automata as stated:

  1. Use the approach on p. 46 in the book to construct a DFA for the following language: all strings that have an odd number of 0s or end at 00 (or both). Construct the two simpler automata first (you don't need to submit them)
  2. Use the approach on p. 46 in the book (modified for an intersection instead of a union) to construct a DFA for the following language: all strings that have at least three 0s and at most two 1s. Construct the two simpler automata first (you don't need to submit them)
  3. Construct an NFA for the language of all strings with at least two 0s and at least two 1s.
  4. Construct an NFA for the language of all strings that have at least two occurrences of a pattern 01 and at least one occurrence of 101. The patterns may overlap
  5. Use the "convert to DFA" function to convert to DFA an NFA for the language of all strings with at least two 0s.
  6. Use the "convert to DFA" function to convert to DFA an NFA for the language of all strings that end with two 1s.

Using JFLAP and naming your files

What to submit


CSci 3501 course web site.

The views and opinions expressed in this page are strictly those of the page author. The contents of this page have not been reviewed or approved by the University of Minnesota.