This article is cited in 1 paper

On complexity of the word problem for finitely presented commutative semigroups

V. Yu. Popov

Ural State University

Abstract: The word problem is tractable on a real-time Turing machine for every finitely presented commutative semigroup.

Keywords: commutative semigroup, word problem.

UDC: 512:519.4

Received: 19.11.2001

 English version: Siberian Mathematical Journal, 2002, 43:6, 1086–1093

Bibliographic databases:

• 
• 
•