Faculteit der Wiskunde en Informatica, VU, Amsterdam  Home/Search
Context
Related
| pps.jussieu.fr/~mellies/...braids.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: pps.jussieu.fr/~mellies/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We show that braids can be described as an orthogonal system in the sense of [1][2]. Their computation is therefore confluent, which was already shown by Garside [4]. 1 An addition on binary relation We propose a notion of addition on binary relations. Let A be a binary relation on X. We note A the negation of A, A its reverse and A = (A its dual. Let A and B two binary relations on X. We define the addition A + B as the relation: A+ B = (A " B Lemma 1 (associativity of A+ B) Let ... (Update)
Similar documents (at the sentence level):
49.4%: Braids Described as an Orthogonal Rewriting System - Mellies (Correct)
Active bibliography (related documents): More All
0.0: A Survey of Abstract Rewriting - Bognar (1995) (Correct)
0.0: Some Notes on Logic Programming with a Relational Machine.. - Lipton, Chapman (1998) (Correct)
0.0: Program Construction by Parts - Frappier, Mili, Desharnais (1995) (Correct)
Similar documents based on text: More All
0.3: Free Groups And Finite Type Invariants Of Pure Braids - Mostovoy, Willerton (1999) (Correct)
0.2: Flypes Of Closed 3-Braids In The Standard Contact Space - Ko, Lee (1999) (Correct)
0.2: Gauß Sum Invariants, Vassiliev Invariants And Braiding Sequences - Stoimenow (1999) (Correct)
BibTeX entry: (Update)
@misc{ wiskunde-braids,
author = "Faculteit Der Wiskunde",
title = "Braids described as an orthogonal rewriting system Paul-Andr'e Melli`es",
url = "citeseer.ist.psu.edu/730335.html" }
Citations (may not include all citations):474 Term Rewriting Systems - Klop - 1992 ACM
36 Call by Need Computations in Non-Ambiguous Linear Term Rewri.. (context) - Huet - 1979
19 relations and Graphs (context) - Schmidt, Strolein ACM
1 This article was processed using the L (context) - group, groups et al. - 1969
Documents on the same site (http://www.pps.jussieu.fr/~mellies/papers.html): More
Semantic Types: A Fresh Look at the Ideal Model for Types - Vouillon, Mellies, Diderot (2004) (Correct)
Double Categories: a modular model of multiplicative linear logic - Mellies (Correct)
Asynchronous Games 2 - The true concurrency of innocence - Mellies (2004) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC