Related papers: The kappa-word problem over DRH
We denote by kappa the implicit signature that contains the multiplication and the (omega-1)-power. It is proved that for any completely kappa-reducible pseudovariety of groups H, the pseudovariety DRH of all finite semigroups whose regular…
The implicit signature k consists of the multiplication and the ({\omega}-1)-power. We describe a procedure to transform each {\kappa}-term over a finite alphabet A into a certain canonical form and show that different canonical forms have…
In this paper we study the $\kappa$-word problem for the pseudovariety ${\bf LG}$ of local groups, where $\kappa$ is the canonical signature consisting of the multiplication and the pseudoinversion. We solve this problem by transforming…
This paper deals with the reducibility property of semidirect products of the form $\bf V*\bf D$ relatively to graph equation systems, where $\bf D$ denotes the pseudovariety of definite semigroups. We show that, if the pseudovariety $\bf…
In this paper we exhibit a type of semigroup presentations which determines a class of local groups. We show that the finite elements of this class generate the pseudovariety ${\bf LG}$ of all finite local groups and use them as…
We show that the following problems are decidable in a rank 2 free group F_2: does a given finitely generated subgroup H contain primitive elements? and does H meet the orbit of a given word u under the action of G, the group of…
In this paper, we investigate the reducibility property of semidirect products of the form $\bf V*\bf D$ relatively to (pointlike) systems of equations of the form $x_1=\cdots=x_n$, where $\bf D$ denotes the pseudovariety of definite…
We explore a natural class of semigroups that have word problem decidable by finite state automata. Among the main results are invariance of this property under change of generators, invariance under basic algebraic constructions and…
We show that the pointlike and the idempotent pointlike problems are reducible with respect to natural signatures in the following cases: the pseudovariety of all finite semigroups in which the order of every subgroup is a product of…
We give a ranker-based description using finite-index congruences for the variety $\boldsymbol{\mathrm{DAb}}$ of finite monoids whose regular $\mathcal{D}$-classes form Abelian groups. This combinatorial description yields a normal form for…
Let H be a pseudovariety of groups and DRH be the pseudovariety containing all finite semigroups whose regular R-classes belong to H. We study the relationship between reducibility of H and of DRH with respect to several particular classes…
In this paper we provide universal formulas describing Drinfeld-type quantization of inhomogeneous orthogonal groups determined by a metric tensor of an arbitrary signature living in a spacetime of arbitrary dimension. The metric tensor…
We study groups of reversible cellular automata, or CA groups, on groups. More generally, we consider automorphism groups of subshifts of finite type on groups. It is known that word problems of CA groups on virtually nilpotent groups are…
We consider the complexity of deciding membership of a given finite semigroup to a fixed pseudovariety. While it is known that there exist pseudovarieties with NP-complete or even undecidable membership problems, for many well-known…
Let $\kappa,\lambda$ be regular cardinals, $\lambda\le\kappa$, let $\varphi$ be a sentence of the language $\mathcal L_{\kappa,\lambda}$ in a given signature, and let $\vartheta(\varphi)$ express the fact that $\varphi$ holds in a submodel,…
In this paper, the Identity Problem for certain groups, which asks if the subsemigroup generated by a given finite set of elements contains the identity element, is related to problems regarding ordered groups. Notably, the Identity Problem…
Let $G=F\ast_\varphi t$ be an HNN extension of a free group $F$ with two equal associated normal subgroups $H_1 = H_2$ of finite index. We prove that the word problem in $G$ is decidable in polynomial time. This result extends to the case…
Given any collection F of computable functions over the reals, we show that there exists an algorithm that, given any L_F-sentence \varphi containing only bounded quantifiers, and any positive rational number \delta, decides either "\varphi…
The article surveys some decidability results for DPDAs on infinite words (omega-DPDA). We summarize some recent results on the decidability of the regularity and the equivalence problem for the class of weak omega-DPDAs. Furthermore, we…
In this paper, we study the word problem for automaton semigroups and automaton groups from a complexity point of view. As an intermediate concept between automaton semigroups and automaton groups, we introduce automaton-inverse semigroups,…