A finiteness condition for rewriting systems
From MaRDI portal
Publication:1331943
DOI10.1016/0304-3975(94)90175-9zbMath0863.68082OpenAlexW1978362621MaRDI QIDQ1331943
Yuji Kobayashi, Craig C. Squier, Friedrich Otto
Publication date: 29 August 1994
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(94)90175-9
Related Items (61)
THE PROPERTY FDT IS UNDECIDABLE FOR FINITELY PRESENTED MONOIDS THAT HAVE POLYNOMIAL-TIME DECIDABLE WORD PROBLEMS ⋮ SECOND ORDER DEHN FUNCTIONS OF GROUPS AND MONOIDS ⋮ ON HOMOTOPICAL AND HOMOLOGICAL FINITENESS CONDITIONS FOR FINITELY PRESENTED MONOIDS ⋮ SOME EXACT SEQUENCES FOR THE HOMOTOPY (BI-)MODULE OF A MONOID ⋮ Finite derivation type for Rees matrix semigroups ⋮ A Lyndon's identity theorem for one-relator monoids ⋮ Coherent confluence modulo relations and double groupoids ⋮ Crystal monoids \& crystal bases: rewriting systems and biautomatic structures for plactic monoids of types \(A_{n}\), \(B_{n}\), \(C_{n}\), \(D_{n}\), and \(G_{2}\) ⋮ A new finiteness condition for monoids presented by complete rewriting systems (after Craig C. Squier) ⋮ Trivializers and 2-Complexes ⋮ FDT is undecidable for finitely presented monoids with solvable word problems ⋮ Algebraic coherent confluence and higher globular Kleene algebras ⋮ Constructing finitely presented monoids which have no finite complete presentation ⋮ The Whitehead heritage ⋮ Finite derivation type for large ideals. ⋮ Markov semigroups, monoids and groups ⋮ Finite derivation type for semi-direct products of monoids ⋮ Knuth's coherent presentations of plactic monoids of type A ⋮ Conditional semi-Thue systems for presenting monoids ⋮ Homology of Gaussian groups. ⋮ Homotopy bases and finite derivation type for subgroups of monoids. ⋮ Braids via term rewriting ⋮ For finitely presented monoids the homological finiteness conditions FHT and \(\text{bi-FP}_3\) coincide ⋮ Undecidable properties of monoids with word problem solvable in linear time. II: Cross sections and homological and homotopical finiteness conditions. ⋮ Shuffle polygraphic resolutions for operads ⋮ Categorification, term rewriting and the Knuth-Bendix procedure ⋮ Topological finiteness properties of monoids. I: Foundations ⋮ Coherence for plactic monoids via rewriting theory and crystal structures ⋮ Towards an algebraic theory of Boolean circuits. ⋮ Abstract strategies and coherence ⋮ The algebra of rewriting for presentations of inverse monoids ⋮ Finite derivation type for semilattices of semigroups. ⋮ Higher-dimensional normalisation strategies for acyclicity ⋮ On some homotopical and homological properties of monoid presentations. ⋮ Coherence of Gray Categories via Rewriting ⋮ Noncommutative Gröbner Bases: Applications and Generalizations ⋮ Finite Gröbner-Shirshov bases for plactic algebras and biautomatic structures for plactic monoids. ⋮ Algebra and geometry of rewriting ⋮ A coherence theorem for pseudonatural transformations ⋮ On properties not inherited by monoids from their Schützenberger groups. ⋮ A folk model structure on omega-cat ⋮ On finite complete rewriting systems, finite derivation type, and automaticity for homogeneous monoids ⋮ On higher order homological finiteness of rewriting systems. ⋮ Homological Finite Derivation Type ⋮ Convergent presentations and polygraphic resolutions of associative algebras ⋮ FINITENESS CONDITIONS FOR REWRITING SYSTEMS ⋮ Algebraic topology and concurrency ⋮ Groupoids and the algebra of rewriting in group presentations ⋮ Polygraphic resolutions and homology of monoids ⋮ Monoid Presentations and Associated Groupoids ⋮ A cubical Squier’s theorem ⋮ Finite complete rewriting systems and finite derivation type for small extensions of monoids ⋮ Chinese syzygies by insertions ⋮ On Finite Complete Presentations and Exact Decompositions of Semigroups ⋮ Finite homotopy bases of one-relator monoids ⋮ Homotopy reduction systems for monoid presentations ⋮ Polygraphs of finite derivation type ⋮ Coherent presentations of Artin monoids ⋮ Rewriting in Gray categories with applications to coherence ⋮ Confluence of algebraic rewriting systems ⋮ A rewriting coherence theorem with applications in homotopy type theory
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finite complete rewriting systems and the complexity of word problem
- About the descriptive power of certain classes of finite string-rewriting systems
- Complete rewriting systems and homology of monoid algebras
- Word problems and a homological finiteness condition for monoids
- Finite derivation type implies the homological finiteness condition \(FP_ 3\)
- A new finiteness condition for monoids presented by complete rewriting systems (after Craig C. Squier)
This page was built for publication: A finiteness condition for rewriting systems
