1. In class we've seen algorithms that transform NFA to DFA, or regular experssion to NFA etc. Can we assume that Turing machines can implement those algorithms? For example, can we say that TM M on NFA <N> finds an equal DFA?

2. Can we assume that f is onto? i.e. that for every word w in the language there exists n such that f(n)=w?