We generalize to eventually regular (or ‘π-regular’) semigroups the study of the lattice of full regular subsemigroups of a regular semigroup, which has its most complete exposition in the case of inverse semigroups. By means of a judicious definition, it is shown that the full eventually regular subsemigroups of such a semigroup form a complete lattice LF , which projects onto the lattices of ...

The class of ω-regular languages provides a robust specification language in verification. Every ω-regular condition can be decomposed into a safety part and a liveness part. The liveness part ensures that something good happens “eventually”. Finitary liveness was proposed by Alur and Henzinger as a stronger formulation of liveness [AH98]. It requires that there exists an unknown, fixed bound b...

We investigate regular realizability (RR) problems, which are the problems of verifying whether the intersection of a regular language – the input of the problem – and a fixed language, called a filter, is non-empty. In this paper we focus on the case of context-free filters. The algorithmic complexity of the RR problem is a very coarse measure of the complexity of context-free languages. This ...

Conjunctive regular path queries are an expressive extension of the well-known class of conjunctive queries. Such queries have been extensively studied in the (graph) database community, since they support a controlled form of recursion and enable sophisticated path navigation. Somewhat surprisingly, there has been little work aimed at using such queries in the context of description logic (DL)...

In this paper, the reconcilability between the P-value and the posterior probability in testing a point null hypothesis against the one-sided hypothesis is considered. Two essential families, non regular and exponential family of distributions, are studied. It was shown in a non regular family of distributions; in some cases, it is possible to find a prior distribution function under which P-va...

Antipodal covers of strongly regular graphs which are not necessarily distance-regular are studied. The structure of short cycles in an antipodal cover is considered. In most cases, this provides a tool to determine if a strongly regular graph has an antipodal cover. In these cases, covers cannot be distance-regular except when they cover a complete bipartite graph. A relationship between antip...

A regular inductive limit of sequentially complete spaces is sequentially complete. For the converse of this theorem we have a weaker result: if indEn is sequentially complete inductive limit, and each constituent space En is closed in indEn, then indEn is α-regular.