Hyper-regularity [7] is a property of matrices over skew polynomials. In this contribution we consider the skew polynomial ring K[d/dt], with K the field of meromorphic functions and with the multiplication rule d/dt · f = f · d/dt + df /dt for all f ∈ K-see e. g. [3, Chpt. 0.10]. A matrix M ∈ K[d/dt] n×m is hyper-regular if it can be transformed into a constant matrix of maximal rank in reduced echelon form, i. e., if there are unimodular matrices UIn [7], it has been proposed to check hyper-regularity by transformation into Smith-Jacobson form [3]. However, algorithms for the transformation into Smith-Jacobson form are rather computational costly. Therefore, we present an efficient algorithm for testing whether a matrix is hyper-regular, based on row-reduction (and the analogous column-reduction)-see [2, Def. 2.1 and Thm. 2.2]. The algorithm also provides the corresponding transformation matrices and is based on the following result:Theorem 1. If n ≥ m (n < m) then M is hyper-regular if and only if row-reduction (columnreduction) of M yields a matrix over K of rank m (rank n).The derived algorithm has an important application in control theory. It can be used to check, e.g., linear time varying control systems of the form84