|
Fundamentalnaya i Prikladnaya Matematika, 2010, Volume 16, Issue 3, Pages 227–236
(Mi fpm1329)
|
|
|
|
Algorithmic solvability of word problem for some varieties of linear quasigroups
A. Kh. Tabarov Tajik National University
Abstract:
The algorithmic word problem is solvable for free algebras in some varieties of linear quasigroups.
Citation:
A. Kh. Tabarov, “Algorithmic solvability of word problem for some varieties of linear quasigroups”, Fundam. Prikl. Mat., 16:3 (2010), 227–236; J. Math. Sci., 177:6 (2011), 930–936
Linking options:
https://www.mathnet.ru/eng/fpm1329 https://www.mathnet.ru/eng/fpm/v16/i3/p227
|
Statistics & downloads: |
Abstract page: | 245 | Full-text PDF : | 129 | References: | 48 | First page: | 2 |
|