Computer Science 313
Theory of Computation
Assignment 2 - Chapter 1 (continued)
Due Monday, 02 February
Exercises 1.7bcd, 1.10, and 1.15, and Problems 1.31, 1.32
Hint on Exercise 1.7: make sure not to leave any transitions unspecified. The trick is to realize that with
nondeterminism, there has to be some possible way for the automaton to do the appropriate thing
(accept or reject) with any input. But if you leave a transition unspecified, that may not be possible.
- Problem 1.34
- If you did the DFA programming project in the
(and even if you didn't), modify your code to create an NFA class that
supports the additional transitions of an NFA. For extra-extra credit, your
NFA class could have a buildDFA method that uses the Subset
Construction to build a DFA object from an NFA object.