## Description

• Read through page 98 the book. However, the material on pages 70 through 76 is optional.

• Problem 1.51 page 90.

• Use the procedure shown in class to Minimize the following Deterministic Finite Automata:

In all cases Σ = {a, b} and the start state is the one on the first row of the table and F

indicates accept state. (from Kozen)

A.

a b

1 6 3

2 5 6

3F 4 5

4F 3 2

5 2 1

6 1 4

B.

a b

1 2 3

2 5 6

3F 1 4

4F 6 3

5 2 1

6 5 4

C.

a b

0F 3 2

1F 3 5

2 2 6

3 2 1

4 5 4

5 5 3

6 5 0

D.

a b

0 3 5

1 2 4

2 6 3

3 6 6

4F 0 2

5F 1 6

6 2 6

Homework Policies: You may study together in small groups and discuss ideas about the

homework problems before composing the solutions. You are expected, however, to write the

solutions yourselves and not copy them from other students or share your solutions with other

students. If you have worked closely with other students on particular problems, then you must

mention the names of the people you have worked with and also the problems on which you worked

together.

1