On the complexity of the word problem for finitely presented commutative semigroups.
Sibirskij Matematicheskij Zhurnal (2002)
- Volume: 43, Issue: 6, page 1339-1349 (2002); translation in Sib. Math. J. 43
- ISSN: 0037-4474
Access Full Article
top
How to cite
topPopov, V.Yu.. "On the complexity of the word problem for finitely presented commutative semigroups.." Sibirskij Matematicheskij Zhurnal 43.6 (2002): 1339-1349 (2002); translation in Sib. Math. J. 43. <http://eudml.org/doc/50266>.
@article{Popov2002,
author = {Popov, V.Yu.},
journal = {Sibirskij Matematicheskij Zhurnal},
keywords = {word problem; commutative semigroup; real time Turing machine},
language = {eng},
number = {6},
pages = {1339-1349 (2002); translation in Sib. Math. J. 43},
publisher = {Sibirskoe Otdelenie Rossijskoj Akademii Nauk, Institut Matematiki Im. S. L. Soboleva SO RAN, Novosibirsk; Izdatel'stvo Instituta Matematiki},
title = {On the complexity of the word problem for finitely presented commutative semigroups.},
url = {http://eudml.org/doc/50266},
volume = {43},
year = {2002},
}
TY - JOUR
AU - Popov, V.Yu.
TI - On the complexity of the word problem for finitely presented commutative semigroups.
JO - Sibirskij Matematicheskij Zhurnal
PY - 2002
PB - Sibirskoe Otdelenie Rossijskoj Akademii Nauk, Institut Matematiki Im. S. L. Soboleva SO RAN, Novosibirsk; Izdatel'stvo Instituta Matematiki
VL - 43
IS - 6
SP - 1339
EP - 1349 (2002); translation in Sib. Math. J. 43
LA - eng
KW - word problem; commutative semigroup; real time Turing machine
UR - http://eudml.org/doc/50266
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.