Related papers: Efficient Membership Testing for Pseudovarieties o…
We look at classes of languages associated to the fragment of first-order logic B{\Sigma}1 which disallows quantifier alternations. Each class is defined by choosing the set of predicates on positions that may be used. Two key such…
If $m \in \mathbb{N}$ and $A$ is a finite subset of $\bigcup_{k \in \mathbb{N} \setminus \{0,1\}} \{1,\ldots,m-1\}^k$, then we denote by \begin{align*} \mathscr{C}(m,A) = \left\{S\in \mathscr{S}_m \mid s_1+\cdots+s_k-m \in S \mbox{ if }…
We investigate the decidability of the definability problem for fragments of first order logic over finite words enriched with modular predicates. Our approach aims toward the most generic statements that we could achieve, which…
In this paper, we investigate the computational complexity of isomorphism testing for finite groups and quasigroups, given by their multiplication tables. We crucially take advantage of their various decompositions to show the following: -…
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…
Motivated by its applications to the word problem for one-relator inverse monoids, via results of Ivanov, Margolis, and Meakin (2001), we prove several decidability and undecidability results about the submonoid membership problem in…
We obtain new explicit pseudorandom generators for several computational models involving groups. Our main results are as follows: 1. We consider read-once group-products over a finite group $G$, i.e., tests of the form $\prod_{i=1}^n…
We show that for quasivarieties of p-algebras the properties of (i) having decidable first-order theory and (ii) having decidable first-order theory of the finite members, coincide. The only two quasivarieties with these properties are the…
The set of finitely generated subgroups of the group $PL_+(I)$ of orientation-preserving piecewise-linear homeomorphisms of the unit interval includes many important groups, most notably R.~Thompson's group $F$. In this paper we show that…
We show that pseudovarieties of finitely generated algebras, i.e., classes $C$ of finitely generated algebras closed under finite products, homomorphic images, and subalgebras, can be described via a uniform structure $U$ on the free…
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 exhibit a 6-element semigroup that has no finite identity basis but nevertheless generates a variety whose finite membership problem admits a polynomial algorithm.
We study the class of languages that have membership proofs which can be verified by real-time finite-state machines using only a constant number of random bits, regardless of the size of their inputs. Since any further restriction on the…
Fix a finite semigroup $S$ and let $a_1,\ldots,a_k, b$ be tuples in a direct power $S^n$. The subpower membership problem (SMP) for $S$ asks whether $b$ can be generated by $a_1,\ldots,a_k$. For bands (idempotent semigroups), we provide a…
Set-membership estimation is usually formulated in the context of set-valued calculus and no probabilistic calculations are necessary. In this paper, we show that set-membership estimation can be equivalently formulated in the probabilistic…
Motivated by approaches to the word problem for one-relation monoids arising from work of Adian and Oganesian (1987), Guba (1997), and Ivanov, Margolis and Meakin (2001), we study the submonoid and rational subset membership problems in…
Incomplete preferences are likely to arise in real-world preference aggregation scenarios. This paper deals with determining whether an incomplete preference profile is single-peaked. This is valuable information since many intractable…
We investigate the rank of pseudovarieties defined by several of the variants of nilpotency conditions for semigroups in the sense of Mal'cev. For several of them, we provide finite bases of pseudoidentities. We also show that the…
We study membership problems in HNN extensions of free groups and then apply these results to solve the word problem in certain families of one-relator inverse monoids. In more detail, we consider HNN extensions where the defining…
We initiate the systematic study of loop conditions of arbitrary finite width. Each loop condition is a finite set of identities of a particular shape, and satisfaction of these identities in an algebra is characterized by it forcing a…