# Hw4Addon - Homework 4  add-on  CISC 303 Timo Kötzing...

This preview shows page 1. Sign up to view the full content.

This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Homework 4  add-on  CISC 303 Timo Kötzing (tkoe@udel.edu) Monday, March 16. Friday, March 27. Handed out: Due Date: Problem 1. (8 points) Use the algorithm from class1 to minimize the following DFAs. Show all work. (i) a 0 1 a (ii) a b a a b 0 1 2 b Problem 2. (8 points) Use the algorithm from class2 to minimize the following DFAs. Show all work. (i) b 0 a a b b 2 a 1 5 a, b b 3 a a, b 4 (ii) b 1 a, b 3 a a 0 a b 2 a 4 b b 1 The algorithm given in class for converting a DFA into an equivalent regular expression is roughly that given in Lecture 9 in the textbook, starting on page 51. 2 The algorithm given in class for converting a DFA into an equivalent minimal DFA is roughly that given in Lecture 14 in the textbook. 1 ...
View Full Document

## This note was uploaded on 02/01/2012 for the course CISC 303 taught by Professor Carberry,m during the Spring '08 term at University of Delaware.

Ask a homework question - tutors are online