Decidability of semigroup identities in soluble groups (Q2776804)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1716761
Language Label Description Also known as
default for all languages
No label defined
    English
    Decidability of semigroup identities in soluble groups
    scientific article; zbMATH DE number 1716761

      Statements

      Decidability of semigroup identities in soluble groups (English)
      0 references
      0 references
      0 references
      23 February 2003
      0 references
      semigroup identities
      0 references
      finitely generated soluble groups
      0 references
      solvable word problem
      0 references
      test words
      0 references
      0 references
      The authors prove that a semigroup identity on a finitely generated soluble group with solvable word problem is decidable. The proof is done by giving an effectively computable bound for the number of test words for the identity.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references