On the efficient construction of quasi-reversible automata for reversible languages