Add to ORKGEl propósito del trabajo es introducir los problemas clásicos de decisión en la teoría de grupos haciendo un especial hincapié en el problema de la palabra para grupos policíclicos
AbstractWe classify the residual finiteness of infinite amalgamated free products of infinite cyclic...
Abstract. We establish virtual surjection to pairs (VSP) as a general criterion for the finite prese...
We prove two theorems regarding the algorithmic theory of groups. First, that the compressed word pr...
For finite group presentations, the word problem is solvable if and only if the Dehn function is com...
Every finitely presented group G has a quotient group with solvable word problem – namely the trivia...
This paper describes a new procedure, based on string rewriting rules, for verifying that a finitely...
For any group G and generating set X we shall be primarily concerned with three sets of words over X...
The word problem of a finitely generated group is a fundamental notion in group theory; it can be de...
International audienceWe show that there is no algorithm deciding whether the maximal residually fre...
Chapter 1 defines basic ideas such as definition of monoids, homomorphisms of monoids, congruences, ...
AbstractWe prove that the isomorphism problem for finitely generated fully residually free groups (o...
Let G be a finitely generated virtually-free group. We consider the Birget-Rhodes expansion of G, wh...
We establish {\em{virtual surjection to pairs}} (VSP) as a general criterion for the finite presenta...
We find a lower bound to the size of finite groups detecting a given word in the free group, more pr...
We call a language poly-context-free if it is an intersection of finitely many contextfree language...
AbstractWe classify the residual finiteness of infinite amalgamated free products of infinite cyclic...
Abstract. We establish virtual surjection to pairs (VSP) as a general criterion for the finite prese...
We prove two theorems regarding the algorithmic theory of groups. First, that the compressed word pr...
For finite group presentations, the word problem is solvable if and only if the Dehn function is com...
Every finitely presented group G has a quotient group with solvable word problem – namely the trivia...
This paper describes a new procedure, based on string rewriting rules, for verifying that a finitely...
For any group G and generating set X we shall be primarily concerned with three sets of words over X...
The word problem of a finitely generated group is a fundamental notion in group theory; it can be de...
International audienceWe show that there is no algorithm deciding whether the maximal residually fre...
Chapter 1 defines basic ideas such as definition of monoids, homomorphisms of monoids, congruences, ...
AbstractWe prove that the isomorphism problem for finitely generated fully residually free groups (o...
Let G be a finitely generated virtually-free group. We consider the Birget-Rhodes expansion of G, wh...
We establish {\em{virtual surjection to pairs}} (VSP) as a general criterion for the finite presenta...
We find a lower bound to the size of finite groups detecting a given word in the free group, more pr...
We call a language poly-context-free if it is an intersection of finitely many contextfree language...
AbstractWe classify the residual finiteness of infinite amalgamated free products of infinite cyclic...
Abstract. We establish virtual surjection to pairs (VSP) as a general criterion for the finite prese...
We prove two theorems regarding the algorithmic theory of groups. First, that the compressed word pr...