相关论文: Uniform decision problems in automatic semigroups
We show that the word problem for an amalgam $[S_1,S_2;U,\omega_1,\omega_2]$ of inverse semigroups may be undecidable even if we assume $S_1$ and $S_2$ (and therefore $U$) to have finite $\mathcal{R}$-classes and $\omega_1,\omega_2$ to be…
We prove that the word problem is undecidable in functionally recursive groups, and that the order problem is undecidable in automata groups, even under the assumption that they are contracting.
This note proves a generalisation to inverse semigroups of Anisimov's theorem that a group has regular word problem if and only if it is finite, answering a question of Stuart Margolis. The notion of word problem used is the two-tape word…
Motivated by the question of which completely regular semigroups have context-free word problem, we show that for certain classes of languages $\mathfrak{C}$(including context-free), every completely regular semigroup that is a union of…
The power semigroup of a semigroup $ S $ is the semigroup of all nonempty subsets of $ S $ equipped with the naturally defined multiplication. A class $\mathcal{K} $ of semigroups is globally determined if any two members of $ \mathcal{K} $…
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…
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…
We develop a combinatorial approach to the study of semigroups and monoids with finite presentations satisfying small overlap conditions. In contrast to existing geometric methods, our approach facilitates a sequential left-right analysis…
The matrix semigroup membership problem asks, given square matrices $M,M_1,\ldots,M_k$ of the same dimension, whether $M$ lies in the semigroup generated by $M_1,\ldots,M_k$. It is classical that this problem is undecidable in general but…
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…
The main result of this paper is the decidability of the membership problem for $2\times 2$ nonsingular integer matrices. Namely, we will construct the first algorithm that for any nonsingular $2\times 2$ integer matrices $M_1,\dots,M_n$…
The main results of this paper is to give a complete characterization of the automaticity of one-relator semigroups with length less than or equal to three. Let $S=sgp\langle A|u=v\rangle$ be a semigroup generated by a set…
We study the connection between small-overlap conditions and automaticity of semigroups. We restrict the discussion to conditions that imply embeddability and under which each relation decomposes into at least seven pieces. For these…
Using a variant of Schreier's Theorem, and the theory of Green's relations, we show how to reduce the computation of an arbitrary subsemigroup of a finite regular semigroup to that of certain associated subgroups. Examples of semigroups to…
The left regular band structure on a hyperplane arrangement and its representation theory provide an important connection between semigroup theory and algebraic combinatorics. A finite semigroup embeds in a real hyperplane face monoid if…
We investigate the computational complexity for determining various properties of a finite transformation semigroup given by generators. We introduce a simple framework to describe transformation semigroup properties that are decidable in…
We introduce the inverse monoid of inner partial automorphisms of a semigroup -- a tool that associates to every semigroup an inverse semigroup. When the semigroup is a group, this inverse semigroup is isomorphic to the group of inner…
Multiplicative matrix semigroups with constant spectral radius (c.s.r.) are studied and applied to several problems of algebra, combinatorics, functional equations, and dynamical systems. We show that all such semigroups are characterized…
We investigate the average-case complexity of decision problems for finitely generated groups, in particular the word and membership problems. Using our recent results on ``generic-case complexity'' we show that if a finitely generated…
This paper addresses a decision problem highlighted by Grigorchuk, Nekrashevich, and Sushchanskii, namely the finiteness problem for automaton (semi)groups. For semigroups, we give an effective sufficient but not necessary condition for…