|
Sibirskii Matematicheskii Zhurnal, 2002, Volume 43, Number 6, Pages 1339–1349
(Mi smj1374)
|
|
|
|
This article is cited in 1 scientific paper (total 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.
Received: 19.11.2001
Citation:
V. Yu. Popov, “On complexity of the word problem for finitely presented commutative semigroups”, Sibirsk. Mat. Zh., 43:6 (2002), 1339–1349; Siberian Math. J., 43:6 (2002), 1086–1093
Linking options:
https://www.mathnet.ru/eng/smj1374 https://www.mathnet.ru/eng/smj/v43/i6/p1339
|
Statistics & downloads: |
Abstract page: | 149 | Full-text PDF : | 72 |
|