Polygraphs of finite derivation type

DOI10.1017/S0960129516000220zbMath1396.18004arXiv1402.2587MaRDI QIDQ3130298

Yves Guiraud, Philippe Malbos

Publication date: 11 January 2018

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1402.2587

zbMATH Keywords

word problemstring rewriting2-categorymonoidpolygraphfinite derivation typehomotopy baseshomological type

Mathematics Subject Classification ID

Finite generation, finite presentability, normal forms (diamond lemma, term-rewriting) (16S15) Free semigroups, generators and relations, word problems (20M05) Grammars and rewriting systems (68Q42) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Groupoids, semigroupoids, semigroups, groups (viewed as categories) (18B40)

Related Items (21)

Rewriting modulo isotopies in pivotal linear \((2,2)\)-categories ⋮ Coherent confluence modulo relations and double groupoids ⋮ Algebraic coherent confluence and higher globular Kleene algebras ⋮ Knuth's coherent presentations of plactic monoids of type A ⋮ A combinatorial-topological shape category for polygraphs ⋮ Shuffle polygraphic resolutions for operads ⋮ Coherence for plactic monoids via rewriting theory and crystal structures ⋮ Coherent presentations of monoids with a right-Noetherian Garside family ⋮ A categorical characterization of strong Steiner \(\omega\)-categories ⋮ \( \ell r\)-multisemigroups, modal quantales and the origin of locality ⋮ Abstract strategies and coherence ⋮ Rewriting modulo isotopies in Khovanov-Lauda-Rouquier's categorification of quantum groups ⋮ Unnamed Item ⋮ From Analytical Mechanics Problems to Rewriting Theory Through M. Janet’s Work ⋮ Noncommutative Gröbner Bases: Applications and Generalizations ⋮ Convergent presentations and polygraphic resolutions of associative algebras ⋮ Topological rewriting systems applied to standard bases and syntactic algebras ⋮ A cubical Squier’s theorem ⋮ Categorified cyclic operads ⋮ Chinese syzygies by insertions ⋮ Confluence of algebraic rewriting systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Higher-dimensional normalisation strategies for acyclicity
• For groups the property of having finite derivation type is equivalent to the homological finiteness condition \(FP_ 3\)
• Higher-dimensional word problems with applications to equational logic
• Complete rewriting systems and homology of monoid algebras
• A note on a special one-rule semi-Thue system
• A finite Thue system with decidable word problem and without equivalent finite canonical system
• Word problems and a homological finiteness condition for monoids
• The algebra of oriented simplexes
• Limits indexed by category-valued 2-functors
• Infinite convergent string-rewriting systems and cross-sections for finitely presented monoids
• A finiteness condition for rewriting systems
• Finite derivation type implies the homological finiteness condition \(FP_ 3\)
• Combinatorial group theory.
• About the rewriting systems produced by the Knuth-Bendix completion algorithm
• A new finiteness condition for monoids presented by complete rewriting systems (after Craig C. Squier)
• Algebra and geometry of rewriting
• Cofibrant objects among higher-dimensional categories
• Termination orders for three-dimensional rewriting
• On theories with a combinatorial definition of 'equivalence'
• Identities among relations for higher-dimensional rewriting systems
• A Monoid which is Right FP _∞ but not Left FP ₁
• Higher-dimensional categories with finite derivation type
• On the Homology of Associative Algebras
• Church-Rooser property and homology of monoids
• Coherence in monoidal track categories
• FINITENESS CONDITIONS FOR REWRITING SYSTEMS
• Term Rewriting and All That
• LOW-DIMENSIONAL HOMOTOPY THEORY FOR MONOIDS
• Recursive Unsolvability of a problem of Thue
• Coherent presentations of Artin monoids
• Computing Critical Pairs in 2-Dimensional Rewriting Systems

This page was built for publication: Polygraphs of finite derivation type