Let A be a finite alphabet and let L ⊂ (A∗)n be an n-variable language over A. We say that L is regular if it is the language accepted by a synchronous n-tape finite state automaton, it is quasi-regular if it is accepted by an asynchronous n-tape automaton, and it is weakly regular if it is accepted by a non-deterministic asynchronous n-tape automaton. We investigate the closure properties of t...

We present a new proof of Banaschewski's theorem stating that the completion lift of a uniform surjection is a surjection. The new procedure allows to extend the fact (and, similarly, the related theorem on closed uniform sublocales of complete uniform frames) to quasi-uniformities ("not necessarily symmetric uniformities"). Further, we show how a (regular) Cauchy point on a closed uniform subl...

We define a quasi–projective reduction of a complex algebraic variety X to be a regular map from X to a quasi–projective variety that is universal with respect to regular maps from X to quasi–projective varieties. A toric quasi–projective reduction is the analogous notion in the category of toric varieties. For a given toric variety X we first construct a toric quasi–projective reduction. Then ...

A module M is called epi-retractable if every submodule of M is a homomorphic image of M. Dually, a module M is called co-epi-retractable if it contains a copy of each of its factor modules. In special case, a ring R is called co-pli (resp. co-pri) if RR (resp. RR) is co-epi-retractable. It is proved that if R is a left principal right duo ring, then every left ideal of R is an epi-retractable ...

We study automata-theoretic properties of distances and quasi-distances between words. We show that every additive distance is nite. We also show that every additive quasi-distance is regularity-preserving, that is, the neighborhood of any radius of a regular language with respect to an additive quasi-distance is regular. As an application we present a simple algorithm that constructs a metric ...