CSci 3501 Algorithms and Computability - Lab 7.

October 8. Due Thursday, October 15 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

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

Please design and test the following finite automata:

  1. DFA to recognize the language of all strings that end at an even number of zeros (i.e. the longest substring of 0s at the end of the string is of even length).
  2. DFA to recognize the language of all strings that have a pattern 01 but not 101
  3. DFA to recognize the language of all strings that have a pattern 01 but not 0101
  4. DFA to recognize the language of all strings that have an odd number of occurrences of a pattern 01.

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.