scholarly journals Confluence of algebraic rewriting systems

2021 ◽  
pp. 1-28
Author(s):  
Cyrille Chenavier ◽  
Benjamin Dupont ◽  
Philippe Malbos
Keyword(s):  
Decision Problems ◽  
Algebraic Structures ◽  
Algebraic Models ◽  
Rewriting Systems ◽  
Rewriting System ◽  
Higher Dimensional ◽  
Homological Invariants

Abstract Convergent rewriting systems on algebraic structures give methods to solve decision problems, to prove coherence results, and to compute homological invariants. These methods are based on higher-dimensional extensions of the critical branching lemma that proves local confluence from confluence of the critical branchings. The analysis of local confluence of rewriting systems on algebraic structures, such as groups or linear algebras, is complicated because of the underlying algebraic axioms. This article introduces the structure of algebraic polygraph modulo that formalizes the interaction between the rules of an algebraic rewriting system and the inherent algebraic axioms, and we show a critical branching lemma for algebraic polygraphs. We deduce a critical branching lemma for rewriting systems on algebraic models whose axioms are specified by convergent modulo rewriting systems. We illustrate our constructions for string, linear, and group rewriting systems.

FINITENESS CONDITIONS FOR REWRITING SYSTEMS

2005 ◽  
Vol 15 (01) ◽  
pp. 175-205 ◽  
Author(s):  
STUART MCGLASHAN ◽  
ELTON PASKU ◽  
STEPHEN J. PRIDE
Keyword(s):  
Finiteness Conditions ◽  
Rewriting Systems ◽  
Rewriting System ◽  
Higher Dimensional ◽  
Finite Derivation Type ◽  
Homological Type

Monoids that can be presented by a finite complete rewriting system have both finite derivation type and finite homological type. This paper introduces a higher dimensional analogue of each of these invariants, and relates them to homological finiteness conditions.

scholarly journals Diamond Subgraphs in the Reduction Graph of a One-Rule String Rewriting System

2021 ◽  
Vol 178 (3) ◽  
pp. 173-185
Author(s):  
Arthur Adinayev ◽  
Itamar Stein
Keyword(s):  
Isomorphism Problem ◽  
Complete Characterization ◽  
Hasse Diagram ◽  
Subgraph Isomorphism ◽  
Rewriting Systems ◽  
Rewriting System ◽  
String Rewriting ◽  
Reduction Graph

In this paper, we study a certain case of a subgraph isomorphism problem. We consider the Hasse diagram of the lattice Mk (the unique lattice with k + 2 elements and one anti-chain of length k) and find the maximal k for which it is isomorphic to a subgraph of the reduction graph of a given one-rule string rewriting system. We obtain a complete characterization for this problem and show that there is a dichotomy. There are one-rule string rewriting systems for which the maximal such k is 2 and there are cases where there is no maximum. No other intermediate option is possible.

REWRITING SYSTEMS IN ALTERNATING KNOT GROUPS

2006 ◽  
Vol 16 (04) ◽  
pp. 749-769 ◽  
Author(s):  
FABIENNE CHOURAQUI
Keyword(s):  
Word Problem ◽  
Rewriting Systems ◽  
Rewriting System ◽  
Regular Position

Every tame, prime and alternating knot is equivalent to a tame, prime and alternating knot in regular position, with a common projection. In this work, we show that the augmented Dehn presentation of the knot group of a tame, prime, alternating knot in regular position, with a common projection has a finite and complete rewriting system. This provides an algorithm for solving the word problem with this presentation and we find an algorithm for solving the word problem with the Dehn presentation also.

COMPLETE REWRITING SYSTEMS FOR CODIFIED SUBMONOIDS

2005 ◽  
Vol 15 (02) ◽  
pp. 207-216
Author(s):  
ANTÓNIO MALHEIRO
Keyword(s):  
The Other ◽  
Maximal Subgroups ◽  
Rewriting Systems ◽  
Group Of Units ◽  
Rewriting System ◽  
Other Hand

Given a complete rewriting system R on X and a subset X0 of X+ satisfying certain conditions, we present a complete rewriting system for the submonoid of M(X;R) generated by X0. The obtained result will be applied to the group of units of a monoid satisfying H1 = D1. On the other hand we prove that all maximal subgroups of a monoid defined by a special rewriting system are isomorphic.

scholarly journals Subgroups of finite index in groups with finite complete rewriting systems

2000 ◽  
Vol 43 (1) ◽  
pp. 177-183 ◽  
Author(s):  
S. J. Pride ◽  
Jing Wang
Keyword(s):  
Free Group ◽  
Finite Index ◽  
Rewriting Systems ◽  
Rewriting System

AbstractWe show that if a group G has a finite complete rewriting system, and if H is a subgroup of G with |G : H| = n, then H * Fn–1 also has a finite complete rewriting system (where Fn–1 is the free group of rank n – 1).

REWRITING SYSTEMS AND ORDERINGS ON ARTIN MONOIDS

2007 ◽  
Vol 17 (01) ◽  
pp. 61-75 ◽  
Author(s):  
PATRICK BAHLS ◽  
TYLER SMITH
Keyword(s):  
Rewriting Systems ◽  
Large Type ◽  
Rewriting System

In this paper we introduce a complete rewriting system on any large-type Artin monoid. The rewriting system stems from a well-ordering defined by Burckel on the related class of braid monoids. As a consequence of our rewriting system's existence we will recover the fact that certain large-type monoids are well-orderable, and we will discern finer detail regarding the structure of this associated ordering.

MONOIDS PRESENTED BY REWRITING SYSTEMS AND AUTOMATIC STRUCTURES FOR THEIR SUBMONOIDS

2009 ◽  
Vol 19 (06) ◽  
pp. 771-790 ◽  
Author(s):  
ALAN J. CAIN
Keyword(s):  
New Technique ◽  
Finitely Generated ◽  
Automatic Structures ◽  
Rewriting Systems ◽  
Rewriting System ◽  
Open Questions ◽  
Automatic Structure ◽  
A New Technique

This paper studies rr-, ℓr-, rℓ-, and ℓℓ-automatic structures for finitely generated submonoids of monoids presented by confluent rewriting system that are either finite and special or regular and monadic. A new technique is developed that uses an automaton to "translate" between words in the original rewriting system and words over the generators for the submonoid. This is applied to show that the submonoid inherits any notion of automatism possessed by the original monoid. Generalizations of results of Otto and Ruškuc are thus obtained: every finitely generated submonoid of a monoid presented by a confluent finite special rewriting system admits an automatic structure that is simultaneously rr-, ℓr-, rℓ-, and ℓℓ-automatic; and every finitely generated submonoid of a monoid presented by a confluent regular monadic rewriting system admits an automatic structure that is simultaneously rr- and ℓℓ-automatic. These structures are shown to be effectively computable. An algorithm is given to decide whether the monoid presented by a confluent monadic finite rewriting system is ℓr- or rℓ-automatic. Finally, these results are applied to yield answers to some hitherto open questions and to recover and generalize established results.

CONTEXT-FREE GRAMMARS WITH LINKED NONTERMINALS

2007 ◽  
Vol 18 (06) ◽  
pp. 1271-1282 ◽  
Author(s):  
ANDREAS KLEIN ◽  
MARTIN KUTRIB
Keyword(s):  
Generative Capacity ◽  
Closure Properties ◽  
Rewriting Systems ◽  
Rewriting System ◽  
The Family ◽  
Infinite Degree ◽  
New Type ◽  
Equivalent Systems ◽  
Context Free ◽  
Context Free Grammars

We introduce a new type of finite copying parallel rewriting system, i. e., grammars with linked nonterminals, which extend the generative capacity of context-free grammars. They can be thought of as having sentential forms where some instances of a nonterminal may be linked. The context-free-like productions replace a nonterminal together with its connected instances. New links are only established between symbols of the derived subforms. A natural limitation is to bound the degree of synchronous rewriting. We present an infinite degree hierarchy of separated language families with the property that degree one characterizes the family of regular and degree two the family of context-free languages. Furthermore, the hierarchy is a refinement of the known hierarchy of finite copying rewriting systems. Several closure properties known from equivalent systems are summarized.

String rewriting and homology of monoids

1997 ◽  
Vol 7 (3) ◽  
pp. 207-240 ◽  
Author(s):  
DANIEL E. COHEN
Keyword(s):  
The Other ◽  
Rewriting Systems ◽  
Rewriting System ◽  
String Rewriting

Results of Anick (1986), Squier (1987), Kobayashi (1990), Brown (1992b), and others, show that a monoid with a finite convergent rewriting system satisfies a homological condition known as FP∞.In this paper we give a simplified version of Brown's proof, which is conceptual, in contrast with the other proofs, which are computational.We also collect together a large number of results and examples of monoids and groups that satisfy FP∞ and others that do not. These may provide techniques for showing that various monoids do not have finite convergent rewriting systems, as well as explicit examples with which methods can be tested.

Sign in / Sign up

Export Citation Format

Share Document