Related papers: Recognizing pro-R closures of regular languages

A prefix code L satisfies the condition that no word of L is a proper prefix of another word of L. Recently, Ko, Han and Salomaa relaxed this condition by allowing a word of L to be a proper prefix of at most k words of L, for some `margin'…

We describe a class (called regular) of invariant generalized complex structures on a real semisimple Lie group G. The problem reduces to the description of admissible pairs (\gk, \omega), where \gk is an appropriate regular subalgebra of…

Let V be a normal affine variety over the real numbers R, and let S be a semi-algebraic subset of V(R). We study the subring B(S) of the coordinate ring of V consisting of the polynomials that are bounded on S. We introduce the notion of…

We propose a novel topological perspective on data languages recognizable by orbit-finite nominal monoids. For this purpose, we introduce pro-orbit-finite nominal topological spaces. Assuming globally bounded support sizes, they coincide…

We determine the closure of a cyclic subgroup $H$ of a free group for the pro-{\bf V} topology when {\bf V} is an extension-closed pseudovariety of finite groups. We show that $H$ is always closed for the pro-nilpotent topology and compute…

The seminormalization of an algebraic variety $X$ is the biggest variety linked to $X$ by a finite, birational and bijective morphism. In this paper we introduce a variant of the seminormalization, suited for real algebraic varieties,…

We consider a language together with the subword relation, the cover relation, and regular predicates. For such structures, we consider the extension of first-order logic by threshold- and modulo-counting quantifiers. Depending on the…

Let R be an o-minimal expansion of the real field, and let L(R) be the language consisting of all nested Rolle leaves over R. We call a set nested subpfaffian over R if it is the projection of a boolean combination of definable sets and…

We show that the Word Problem in finitely generated subgroups of $\textsf{GL}_d(\mathbb{Z})$ can be solved in linear average-case complexity. This is done under the bit-complexity model, which accounts for the fact that large integers are…

There are many open questions surrounding the characterisation of groups with context-sensitive word problem. Only in 2018 was it shown that all finitely generated virtually Abelian groups have multiple context-free word problems, and it is…

Motivated by the theory of unitary representations of finite dimensional Lie supergroups, we describe those Lie superalgebras which have a faithful finite dimensional unitary representation. We call these Lie superalgebras unitary. This is…

The common behaviour of many families of numerical semigroups led up to defining, firstly, the Frobenius varieties and, secondly, the (Frobenius) pseudo-varieties. However, some interesting families are still out of these definitions. To…

In a recent thread of papers, we have introduced FQL, a precise specification language for test coverage, and developed the test case generation engine FShell for ANSI C. In essence, an FQL test specification amounts to a set of regular…

We show that if $\mathsf V$ is a semigroup pseudovariety containing the finite semilattices and contained in $\mathsf {DS}$, then it has a basis of pseudoidentities between finite products of regular pseudowords if, and only if, the…

Using generating functions, we enumerate regular semisimple conjugacy classes in the finite classical groups. For the general linear, unitary, and symplectic groups this gives a different approach to known results; for the special…

We introduce the notion of a subregular subalgebra, which we believe is useful for classification of subalgebras of Lie algebras. We use it to construct a non-regular invariant generalized complex structure on a Lie group. As an…

Polynomial closure is a standard operator which is applied to a class of regular languages. In the paper, we investigate three restrictions called left (LPol), right (RPol) and mixed polynomial closure (MPol). The first two were known while…

We prove that a semiregular topological space $X$ is completely regular if and only if its topology is generated by a normal quasi-uniformity. This characterization implies that each regular paratopological group is completely regular. This…

A recent study on structural properties of regular and context-free languages has greatly promoted our basic understandings of the complex behaviors of those languages. We continue the study to examine how regular languages behave when they…

We establish the following model-theoretic characterization: profinite $L$-structures, the cofiltered limits of finite $L$-structures,are retracts of ultraproducts of finite $L$-structures. As a consequence, any elementary class of…