On the existence of minimum asynchronous automata and on the equivalence problem for unambiguous regular trace languages