Algebra and geometry of rewriting

Applied Categorical Structures

Volumn 15, Issue 4, 2007, Pages 415-437

  Lafont, Yves ^a  

^a AIX MARSEILLE UNIVERSITÉ   (France)

Author keywords

Confluence; Generators and relations; Homology; Homotopy; Polygraph; Resolution; Rewriting; Termination

Indexed keywords

ALGEBRA; COMPUTATIONAL GEOMETRY; COMPUTATIONAL METHODS; TOPOLOGY;

HOMOLOGY; HOMOTOPY; POLYGRAPH; POLYGRAPHIC RESOLUTIONS; REWRITING;

COMPUTATION THEORY;

EID: 35349014297     PISSN: 09272852     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10485-007-9083-6     Document Type: Article

References (21)

1. Brown, K.S.: Cohomology of Groups. Springer, Berlin (1982)
2. Burroni, A.: Higher dimensional word problems with applications to equational logic. Theoret. Comput. Sci. 115, 43-62 (1993)
3. Burroni, A.: A new calculation of the Orientals of Street. In: Conference Given in Oxford in April 2000. Available on http://www.math.jussieu.fr/ ~burroni/
4. 3. J. Symbolic Comput. 18, 91-12 (1994)
5. 3. J. Symbolic Comput. 22, 155-177 (1996)
6. Dehornoy, P., Lafont, Y.: Homology of gaussian groups. Ann. Inst. Fourier 53(2), 489-540 (2003)
7. Guiraud, Y.: Termination orders for 3-dimensional rewriting. J. Pure Appl. Algebra 207(2), 341-37 (2006)
8. Katsura, M., Kobayashi, Y.: Constructing finitely presented monoids which have no finite complete presentation. Semigroup Forum 54, 292-302 (1997)
9. Kapur, D., Narendran, P.: The Knuth-Bendix completion procedure and Thue systems. SIAM J. Comput. 14(4), 1052-1072 (1985)
10. Kapur, D., Narendran, P.: A finite Thue system with decidable word problem and without equivalent finite canonical system. Theoret. Comput. Sci. 35, 337-344 (1985)
11. Kobayashi, Y.: Complete rewriting systems and homology of monoid algebras. J. Pure Appl. Algebra 65(3), 263-275 (1990)
12. Lafont, Y.: A new finiteness condition for monoids presented by complete rewriting systems (after Craig Squier). J. Pure Appl. Algebra 98(3), 229-244 (1995)
13. Lafont, Y.: Towards an algebraic theory of Boolean circuits. J. Pure Appl. Algebra 184(2-3), 257-310 (2003)
14. Lafont, Y., Prouté, A.: Church-Rosser property and homology of monoids. Math. Structures Comput. Sci. 1(3), 297-326 (1991)
15. Mac Lane, S.: Homology. Springer, Berlin (1963)
16. Métayer, F.: Resolutions by polygraphs. Theory Appl. Categ. 1(7), 148-184 (2003)
17. Power, J.: An n-categorical pasting theorem. Proceedings of Category Theory, Como 1990. Springer Lecture Notes in Mathematics, 1488, 326-358 (1991)
18. Squier, C., Otto, F., Kobayashi, Y.: A finiteness condition for rewriting systems. Theoret. Comput. Sci. 131, 271-294 (1994)
19. Spanier, C.C.: Algebraic Topology. McGraw-Hill, New York (1966)
20. Squier, C.: Word problems and a homological finiteness condition for monoids. J. Pure Appl. Algebra 49, 201-217 (1987)
21. Street, R.: The algebra of oriented simplexes. J. Pure Appl. Algebra 49, 283-335 (1987)