Related papers: The Word Problem in the Baumslag group with a non-…

Every semigroup which is a finite disjoint union of copies of the free mono- genic semigroup (natural numbers under addition) has soluble word prob- lem and soluble membership problem. Efficient algorithms are given for both problems.

The square-free word problem relative to a system of two defining relations is decidable.

The Hamburger moment problem for the $q$-Lommel polynomials which are related to the Hahn-Exton $q$-Bessel function is known to be indeterminate for a certain range of parameters. In this paper, the Nevanlinna parametrization for the…

We generalize the classical knapsack and subset sum problems to arbitrary groups and study the computational complexity of these new problems. We show that these problems, as well as the bounded submonoid membership problem, are P-time…

For a class of orthogonal polynomials related to the $q$-Meixner polynomials corresponding to an indeterminate moment problem we give a one-parameter family of orthogonality measures. For these measures we complement the orthogonal…

We study the Diophantine problem, i.e. the decision problem of solving systems of equations, for some families of one-relator groups, and provide some background for why this problem is of interest. The method used is primarily the…

It is well known that if $G$ admits a f.g. subgroup $H$ with a weaklyaperiodic SFT (resp. an undecidable domino problem), then $G$itself has a weakly aperiodic SFT (resp. an undecidable domino problem).We prove that we can replace the…

We introduce a new invariant of bipartite chord diagrams and use it to construct the first examples of groups with Dehn function $n^2\log n$ and other small Dehn functions. Some of these groups have undecidable conjugacy problem.

In a previous paper, we have shown that any Boolean formula can be encoded as a linear programming problem in the framework of Bayesian probability theory. When applied to NP-complete algorithms, this leads to the fundamental conclusion…

We study the membership problem to context-free languages L (CFLs) on probabilistic words, that specify for each position a probability distribution on the letters (assuming independence across positions). Our task is to compute, given a…

We construct a finitely presented group with quadratic Dehn function and undecidable conjugacy problem. This solves E. Rips' problem formulated in 1992. v2: misprints corrected. v3: lemmas 4.7, 4.10 corrected, more misprints fixed.

We show, that groups, defined by wide class of automata, including all polynomial ones, act on the set of infinite words not paradoxical

Term algebras are important objects in computer science and are correspondingly well-studied. A natural generalization is to quotient these algebras by finitely many ground term equations, obtaining what we call almost free algebras. One of…

We prove several decidability and undecidability results for the satisfiability and validity problems for languages that can express solutions to word equations with length constraints. The atomic formulas over this language are equality…

We revisit the problem of deciding whether a finitely generated subgroup H is a free factor of a given free group F. Known algorithms solve this problem in time polynomial in the sum of the lengths of the generators of H and exponential in…

Let $G$ be a finite group and $k$ be a field. Let $G$ act on the rational function field $k(x_g:g\in G)$ by $k$-automorphisms defined by $g\cdot x_h=x_{gh}$ for any $g,h\in G$. Noether's problem asks whether the fixed field $k(G)=k(x_g:g\in…

Group languages are regular languages recognized by finite groups, or equivalently by finite automata in which each letter induces a permutation on the set of states. We investigate the separation problem for this class of languages: given…

Based on a theorem of Bergman we show that multivariate noncommutative polynomial factorization is deterministic polynomial-time reducible to the factorization of bivariate noncommutative polynomials. More precisely, we show the following:…

We consider decision problems for relations over finite and infinite words defined by finite automata. We prove that the equivalence problem for binary deterministic rational relations over infinite words is undecidable in contrast to the…

Let H be a pseudovariety of groups in which the kappa-word problem is decidable. Here, kappa denotes the canonical implicit signature, which consists of the multiplication and the (omega-1)-power. We prove that the kappa-word problem is…