Add to ORKG© 2019 Elsevier Inc. The word problem for Thompson\u27s group F has a solution, but it remains unknown whether F is automatic or has a finite or regular convergent (terminating and confluent) rewriting system. We show that the group F admits a natural extension of these two properties, namely autostackability, and we give an explicit bounded regular convergent prefix-rewriting system for F
It is not known whether Thompson's group <i>F</i> is automatic. With the recent extensions of the no...
A finite group is called Pn-sequenceable if its nonidentity elements can be listed x1 , x2 , ..., xk...
We provide an algorithm to solve the word problem in all fundamental groups of 3-manifolds that are ...
The word problem is one of the fundamental areas of research in infinite group theory, and rewriting...
© 2016 Elsevier Inc. Autostackability for finitely presented groups is a topological property of the...
Autostackability for finitely generated groups is defined via a topological property of the associat...
Let G be a finitely presented group with Cayley graph Γ. Roughly, G is a stackable group if there is...
It is not known whether Thompson\u27s group F is automatic. With the recent extensions of the notion...
Results in C∗ algebras, of Matte Bon and Le Boudec, and of Haagerup and Olesen, apply to the R. Thom...
Results in C∗ algebras, of Matte Bon and Le Boudec, and of Haagerup and Olesen, apply to the R. Thom...
Abstract. We describe a generalized Thompson group V(G,θ) for each finite group G with homomorphism ...
We produce a sequence of markings Sk of Thompson\u27s group F within the space Gn of all marked n-ge...
The definition of graph automatic groups by Kharlampovich, Khoussainov and Miasnikov and its extensi...
AbstractLet n be an integer greater than 1, and let G be a group. An n-tuple x1,x2,…xn of elements o...
. A group is combable if it can be represented by a language of words satisfying a fellow traveller ...
It is not known whether Thompson's group <i>F</i> is automatic. With the recent extensions of the no...
A finite group is called Pn-sequenceable if its nonidentity elements can be listed x1 , x2 , ..., xk...
We provide an algorithm to solve the word problem in all fundamental groups of 3-manifolds that are ...
The word problem is one of the fundamental areas of research in infinite group theory, and rewriting...
© 2016 Elsevier Inc. Autostackability for finitely presented groups is a topological property of the...
Autostackability for finitely generated groups is defined via a topological property of the associat...
Let G be a finitely presented group with Cayley graph Γ. Roughly, G is a stackable group if there is...
It is not known whether Thompson\u27s group F is automatic. With the recent extensions of the notion...
Results in C∗ algebras, of Matte Bon and Le Boudec, and of Haagerup and Olesen, apply to the R. Thom...
Results in C∗ algebras, of Matte Bon and Le Boudec, and of Haagerup and Olesen, apply to the R. Thom...
Abstract. We describe a generalized Thompson group V(G,θ) for each finite group G with homomorphism ...
We produce a sequence of markings Sk of Thompson\u27s group F within the space Gn of all marked n-ge...
The definition of graph automatic groups by Kharlampovich, Khoussainov and Miasnikov and its extensi...
AbstractLet n be an integer greater than 1, and let G be a group. An n-tuple x1,x2,…xn of elements o...
. A group is combable if it can be represented by a language of words satisfying a fellow traveller ...
It is not known whether Thompson's group <i>F</i> is automatic. With the recent extensions of the no...
A finite group is called Pn-sequenceable if its nonidentity elements can be listed x1 , x2 , ..., xk...
We provide an algorithm to solve the word problem in all fundamental groups of 3-manifolds that are ...