CSci 3501 Algorithms and Computability - Lab 7.

October 23. Due Wednesday, October 29 at 11:59pm

What to submit and when:

Lab assignment

Work in pairs

Lab overview and goals

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

Using JFLAP and naming your files

Lab tasks

(20 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. DFA to recognize the language of all strings that have at most three zeros.
  2. DFA to recognize the language of all strings that have an even number of zeros and an odd number of ones.
  3. 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).
  4. DFA to recognize the language of all strings that have a pattern 01 but not 101
  5. DFA to recognize the language of all strings that have an odd number of occurrences of a pattern 01, possibly interleaved with more 1s and 0s. For example, 00011 should be accepted while 010010 should not be.

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.