Computer Science 456/656: Automata and Formal Languages
Fall 2000
Homework Assignment 1.
Due Tuesday, September 5, 2000
You may discuss this assignment with other students in the class, or other
persons. But you must actually write the assignment in your own hand.
You must turn in the homework on letter-sized paper, with your name at the
top of each page. Use pen or pencil, any color.
Do not type your homework, and do
not write your homework as a computer file and turn
in a printout.
-
Work problem 1.3 (c,e,f,h) on page 30 of your textbook.
-
Work problem 1.9 on page 31 of your textbook.
-
Work problem 1.14 on page 32 of your textbook.
-
The equivalence relation generated by a relation R
on a set S is defined to be the
smallest equivalence relation on S which
contains R.
What is the equivalence relation generated by the relation
given in part (a) of problem 1.27 on page 33 of your textbook?
-
Work problem 1.30 on page 34 of your textbook.
-
Work problem 1.34 on page 34 of your textbook.

Back to
Course Page