Add to ORKG• Use subword reversing to constructing examples of ordered groups. • Subword Reversing is a combinatorial method • Subword Reversing is a combinatorial method ( ≈ rewrite rule on words) • Subword Reversing is a combinatorial method ( ≈ rewrite rule on words) for investigating (certain) concrete positive group presentations. • Subword Reversing is a combinatorial method ( ≈ rewrite rule on words) for investigating (certain) concrete positive group presentations. all relations of the form w = w ′ with no s−1 in w,w ′ • Subword Reversing is a combinatorial method ( ≈ rewrite rule on words
Gröbner bases, in their noncommutative version, and word reversing are methods for solving the word ...
The Pi family of reversible programming languages for boolean circuits is presented as a syntax of c...
Gröbner bases, in their noncommutative version, and word reversing are methods for solving the word ...
• Use subword reversing to constructing examples of ordered groups. • Subword Reversing is a combina...
We summarize the main known results involving subword reversing, a method of semigroup theory for co...
• A strategy for constructing van Kampen diagrams for semigroups, with various applications: cancell...
AbstractWord reversing is a combinatorial operation on words that detects pairs of equivalent words ...
A new construction of combings is used to distinguish between several previously indistinguishable c...
Abstract. A new construction of combings is used to distinguish between several previously indisting...
updated version with new resultsWe describe a simple scheme for constructing finitely generated mono...
updated version with new resultsWe describe a simple scheme for constructing finitely generated mono...
updated version with new resultsWe describe a simple scheme for constructing finitely generated mono...
A Knuth-Bendix procedure for string rewriting, when applied to a presentation for a group G in an at...
We analyze some specific aspects concerning conditional orderings and relations among them. To this ...
Reversibility is a thread woven through many branches of mathematics. It arises in dynamics, in syst...
Gröbner bases, in their noncommutative version, and word reversing are methods for solving the word ...
The Pi family of reversible programming languages for boolean circuits is presented as a syntax of c...
Gröbner bases, in their noncommutative version, and word reversing are methods for solving the word ...
• Use subword reversing to constructing examples of ordered groups. • Subword Reversing is a combina...
We summarize the main known results involving subword reversing, a method of semigroup theory for co...
• A strategy for constructing van Kampen diagrams for semigroups, with various applications: cancell...
AbstractWord reversing is a combinatorial operation on words that detects pairs of equivalent words ...
A new construction of combings is used to distinguish between several previously indistinguishable c...
Abstract. A new construction of combings is used to distinguish between several previously indisting...
updated version with new resultsWe describe a simple scheme for constructing finitely generated mono...
updated version with new resultsWe describe a simple scheme for constructing finitely generated mono...
updated version with new resultsWe describe a simple scheme for constructing finitely generated mono...
A Knuth-Bendix procedure for string rewriting, when applied to a presentation for a group G in an at...
We analyze some specific aspects concerning conditional orderings and relations among them. To this ...
Reversibility is a thread woven through many branches of mathematics. It arises in dynamics, in syst...
Gröbner bases, in their noncommutative version, and word reversing are methods for solving the word ...
The Pi family of reversible programming languages for boolean circuits is presented as a syntax of c...
Gröbner bases, in their noncommutative version, and word reversing are methods for solving the word ...