CS 456/656 Study Problems 1
Due date: September 20, 2005, 11:30 AM.
This assignment should be worked, but not handed in, since an examination
is scheduled for that day.
-
Find a minimal DFA equivalent to
this NFA.
(In case you cannot view the figure on your browser, here is a
text file showing the
transition table.)
-
Write a regular expression which describes the language accepted
by this DFA.
Back to
Course Page