Project 2

Exploring Regular Languages

Project Overview

This project will give you more practice with DFAs, and will also get you acquainted with nondeterministic finite automata (NFAs) and regular expressions (REGEXs).

What you need to do

Complete the following problems from your textbook (use JFLAP for those that need an automaton, and submit these as separate JFLAP files):

  • 1.6 a-d, f, g, i, j, l, m

  • 1.8 a, b

  • 1.9 a, b

  • 1.10 a, b

  • 1.19 a

  • 1.21 b

  • 1.22 a, b

  • 1.24 a, c, e, g

  • 1.28 a

How to submit

To submit, zip/compress all of your JFLAP files (plus any handwritten or typed answers) to a single compressed file named project2, then upload/submit it to Moodle by the due date.