A new construction of combings is used to distinguish between several previously indistinguishable classes of groups associated to the theory of automatic groups and non-positive curvature in group theory. We construct synchronously bounded combings for a class of groups that are neither bicombable nor automatic. The linguistic complexity of these combings is analysed: in many cases the language of words in the combing is an indexed language
This work treats word problems of finitely generated groups and variations thereof, such as word pro...
This work treats word problems of finitely generated groups and variations thereof, such as word pro...
Unlike other mildly context-sensitive formalisms, Combinatory Categorial Grammar (CCG) cannot be par...
Abstract. A new construction of combings is used to distinguish between several previously indisting...
. A group is combable if it can be represented by a language of words satisfying a fellow traveller ...
Explicit constructions are given to illustrate the loss of control that ensues when one replaces the...
Abstract. Accessible groups whose word problems are accepted by a deterministic nested stack automat...
In the last several years a remarkable interplay between geometry, group theory, and the theory of f...
AbstractWe study the geometry of abelian subgroups relative to combings (normal forms) of automatic ...
The notable exclusions from the family of automatic groups are those nilpotent groups which are not ...
AbstractAfter a brief survey of the known results about group languages, we prove that many of the f...
We study the geometry of abelian subgroups relative to combings (normal forms) of automatic groups a...
This paper corrects the characterisation of biautomatic groups presented in Lemma 2.5.5 in the book ...
• Use subword reversing to constructing examples of ordered groups. • Subword Reversing is a combina...
This work treats word problems of finitely generated groups and variations thereof, such as word pro...
This work treats word problems of finitely generated groups and variations thereof, such as word pro...
This work treats word problems of finitely generated groups and variations thereof, such as word pro...
Unlike other mildly context-sensitive formalisms, Combinatory Categorial Grammar (CCG) cannot be par...
Abstract. A new construction of combings is used to distinguish between several previously indisting...
. A group is combable if it can be represented by a language of words satisfying a fellow traveller ...
Explicit constructions are given to illustrate the loss of control that ensues when one replaces the...
Abstract. Accessible groups whose word problems are accepted by a deterministic nested stack automat...
In the last several years a remarkable interplay between geometry, group theory, and the theory of f...
AbstractWe study the geometry of abelian subgroups relative to combings (normal forms) of automatic ...
The notable exclusions from the family of automatic groups are those nilpotent groups which are not ...
AbstractAfter a brief survey of the known results about group languages, we prove that many of the f...
We study the geometry of abelian subgroups relative to combings (normal forms) of automatic groups a...
This paper corrects the characterisation of biautomatic groups presented in Lemma 2.5.5 in the book ...
• Use subword reversing to constructing examples of ordered groups. • Subword Reversing is a combina...
This work treats word problems of finitely generated groups and variations thereof, such as word pro...
This work treats word problems of finitely generated groups and variations thereof, such as word pro...
This work treats word problems of finitely generated groups and variations thereof, such as word pro...
Unlike other mildly context-sensitive formalisms, Combinatory Categorial Grammar (CCG) cannot be par...