Grammar corresponding to DFA is unambiguous because we have only transition on a terminal from the state in the DFA,
ex $a^{*}$ it have only self loop
and the grammar corresponding to the NFA can be ambiguous because from the same state with a terminal we can go to one or more different state
but there will be at least one unambiguous grammar for every NFA.