scientific article
From MaRDI portal
Publication:3838758
zbMath0914.20052MaRDI QIDQ3838758
Andrea Sattler-Klein, Klaus Madlener, Friedrich Otto
Publication date: 20 June 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
automatic groupsDehn functionsautomatic monoidsfinite complete presentationsderivation typefinitely presented bi-automatic monoids
Generators, relations, and presentations of groups (20F05) Geometric group theory (20F65) Free semigroups, generators and relations, word problems (20M05) Grammars and rewriting systems (68Q42)
Related Items (16)
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}\) ⋮ Notions of hyperbolicity in monoids. ⋮ A geometric characterization of automatic semigroups ⋮ Automatic structure for generalized Bruck-Reilly ∗-extension of a monoid ⋮ Undecidable properties of monoids with word problem solvable in linear time. II: Cross sections and homological and homotopical finiteness conditions. ⋮ Automatic Presentations for Cancellative Semigroups ⋮ Finite Gröbner-Shirshov bases for plactic algebras and biautomatic structures for plactic monoids. ⋮ FA-presentable groups and rings ⋮ Finitely presented monoids with linear Dehn function need not have regular cross-sections. ⋮ Automatic structures for semigroup constructions. ⋮ On finite complete rewriting systems, finite derivation type, and automaticity for homogeneous monoids ⋮ Uniform decision problems for automatic semigroups. ⋮ Finiteness and Dehn functions of automatic monoids having directed fellow traveller property. ⋮ A strong geometric hyperbolicity property for directed graphs and monoids. ⋮ Automatic presentations for semigroups. ⋮ Automatic semigroups
This page was built for publication:
