We investigate the relationship between the classes of languages accepted by deterministic and nondeterministic polynomial time bounded Turing machines and the relationship between the classes of languages accepted by deterministic polynomial time bounded and by nondeterministic polynomial tape bounded Turing machines. In both cases we study generators of the nondeterministic class that generate it by operations that the deterministic class is closed under.