Related papers: Recognizing pro-R closures of regular languages
We prove that it is decidable whether or not a finitely generated submonoid of a virtually free group is graded, introduce a new geometric characterization as quasi-geodesic monoids, and show that their word problem is rational (as a…
We give a topological framework for the study of Sela's limit groups: limit groups are limits of free groups in a compact space of marked groups. Many results get a natural interpretation in this setting. The class of limit groups is known…
Consider $ A^* $, the free monoid generated by the finite alphabet $A$ with the concatenation operation. Two words have the same commutative image when one is a permutation of the symbols of the other. The commutative closure of a set $ L…
This paper studies the classes of semigoups and monoids with context-free and deterministic context-free word problem. First, some examples are exhibited to clarify the relationship between these classes and their connection with the…
We built some congruences on semigroups, from where a decomposition of quasi-separative semigroups was obtained.
We investigate classifications of quasitrivial semigroups defined by certain equivalence relations. The subclass of quasitrivial semigroups that preserve a given total ordering is also investigated. In the special case of finite semigroups,…
It is an open problem to characterize the class of languages recognized by quantum finite automata (QFA). We examine some necessary and some sufficient conditions for a (regular) language to be recognizable by a QFA. For a subclass of…
We exhibit a correspondence between subcategories of modules over an algebra and sub-bimodules of the dual of that algebra. We then prove that the semisimplicity of certain such categories is equivalent to the existence of a Peter-Weyl…
We show that any finite monoid or semigroup presentation satisfying the small overlap condition C(4) has word problem which is a deterministic rational relation. It follows that the set of lexicographically minimal words forms a regular…
For finitely generated subgroups $H$ of a free group $F_m$ of finite rank $m$, we study the language $L_H$ of reduced words that represent $H$ which is a regular language. Using the (extended) core of Schreier graph of $H$, we construct the…
We determine the structure of the intersection of a finitely generated subgroup of a semiabelian variety $G$ defined over a finite field with a closed subvariety $X\subset G$.
Can we do a topological study of various classes of normal subgroups endowed with a hull-kernel-type topology? In this paper, we have provided an answer to this question. We have introduced as well a new class of normal subgroups called…
In this paper we develop an ideal structure theory for the class of left reductive regular semigroups and apply it to several subclasses of popular interest. In these classes we observe that the right ideal structure of the semigroup is…
In this paper, we prove two structure theorems for twisted Chevalley groups $G_\sigma (R)$ over a commutative ring $R$ with unity. The first theorem concerns the normality of $E'_\sigma (R,J)$, the elementary congruence subgroups at level…
Let $A$ be a commutative and unital $\mathbb{R}$-algebra, and $M$ be an Archimedean quadratic module of $A$. We define a submultiplicative seminorm $\|\cdot\|_M$ on $A$, associated with $M$. We show that the closure of $M$ with respect to…
We investigate the properties of formal languages expressible in terms of formulas over quantifier-free theories of word equations, arithmetic over length constraints, and language membership predicates for the classes of regular, visibly…
We introduce the notion of a subgraph generated by an $R$-word $r$ of the Sch\"{u}tzenberger graph of a positive word $w$, $S\Gamma(w)$, where $w$ contains $r$ as its subword. We show that the word problem for a finitely presented Adian…
We investigate the existence of left-invariant closed G$_2$-structures on seven-dimensional non-solvable Lie groups, providing the first examples of this type. When the Lie algebra has trivial Levi decomposition, we show that such a…
The paper begins by exploring the various definitions of norms on semigroups and then presents a new definition of a normed semigroup. The properties of normed semigroups in the new sense are investigated. The new definition of the norm is…
We study the complexity of computation in finitely generated free left, right and two-sided adequate semigroups and monoids. We present polynomial time (quadratic in the RAM model of computation) algorithms to solve the word problem and…