Honors Theory of Computation, Spring'99
Homework 6
-- DATE DUE: May 5, 1999
-- PROBLEMS (these are taken from the textbook, 2nd Edition)
-
Exercise 2.1.1 (page 105). Part (a) only.
-
Exercise 2.1.6 (page 106). Parts (a) to (d).
-
Be as explicit as possible regarding any encodings, machine description, etc.
NOTE: the notation here is somewhat ambiguous. E.g., does the ``O(1)''
term in this question depend on k?
Part of your assignment is to figure this out.
If ``O(1)'' depends on k, then you should write ``Ok(1)''
I call this the ``subscripted big-Oh notation'' -- please
use this ``subscripted notation'' in all your homework.
-
Exercise 2.2.2 (page 116), all parts.
-
Exercise 6.1.2 (page 385), converting NFA to DFA.