CSci 3501 Algorithms and Computability - Lab 8.

October 16. Due Friday, October 23rd at 11:59pm

What to submit and when:

Lab assignment

Work in pairs

Lab overview and goals

The goal of the lab is to practice with JFLAP (a tool for experimenting with finite automata and other computability topics) and to design and test finite automata (DFAs and NFAs).

Using JFLAP and naming your files

Lab tasks

Lab task 1 (28 points)

Unless specified otherwise, the alphabet is the set of 0 and 1. Recall that zero is an even number.

Design and test the following finite automata:

  1. Use the approach on p. 46 in the book to construct a DFA for the following language that is a union of two simpler languages: all strings that have an odd number of 0s or end at 00 (or both). First construct the two simpler automata (you don't need to submit them)
  2. Use the approach on p. 46 in the book (modified to construct 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. First construct the two simpler automata (you don't need to submit them)
  3. Construct an NFA for the language of all strings with at least two 0s or at least two 1s.
  4. Construct an NFA for the language of all strings that have at least two occurrences of a pattern 01.
  5. Construct an automaton (DFA or NFA) for a language of all strings of length at least 3 that have a pattern 01.
  6. Use the "convert to DFA" function of JFLAP to convert an NFA for the language of all strings with at least two 0s to a DFA.
  7. Use the "convert to DFA" function of JFLAP to convert an NFA for the language of all strings that end with two 1s to a DFA.

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.