scientific article; zbMATH DE number 1008515

zbMath0867.68065MaRDI QIDQ4336275

Friedrich Otto, Yuji Kobayashi

Publication date: 7 August 1997

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

finite convergent string-rewriting system

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items

Finite derivation type for Rees matrix semigroups ⋮ A Lyndon's identity theorem for one-relator monoids ⋮ FDT is undecidable for finitely presented monoids with solvable word problems ⋮ Finite derivation type for large ideals. ⋮ Homotopy bases and finite derivation type for subgroups of monoids. ⋮ Homological finiteness properties of monoids, their ideals and maximal subgroups. ⋮ The monoids of the patience sorting algorithm ⋮ Free inverse monoids are not \(\mathrm{FP}_2\) ⋮ Groups acting on semimetric spaces and quasi-isometries of monoids ⋮ On properties not inherited by monoids from their Schützenberger groups. ⋮ On finite complete rewriting systems, finite derivation type, and automaticity for homogeneous monoids ⋮ Groupoids and the algebra of rewriting in group presentations