Abstract. In the paper we introduce and study the uniform regular enumerations for arbitrary recursive ordinals. As an application of the technique we obtain a uniform generalizati...
We show that matrix completion with tracenorm regularization can be significantly hurt when entries of the matrix are sampled nonuniformly. We introduce a weighted version of the ...
We present new and more efficient algorithms for regular language enumeration problems. The min-word problem is to find the lexicographically minimal word of length n accepted by ...