FUNDAMENTALNAYA I PRIKLADNAYA MATEMATIKA

(FUNDAMENTAL AND APPLIED MATHEMATICS)

2010, VOLUME 16, NUMBER 3, PAGES 227-236

Algorithmic solvability of word problem for some varieties of linear quasigroups

A. Kh. Tabarov

Abstract

View as HTML     View as gif image

The algorithmic word problem is solvable for free algebras in some varieties of linear quasigroups.

Main page Contents of the journal News Search

Location: http://mech.math.msu.su/~fpm/eng/k10/k103/k10312h.htm
Last modified: March 24, 2011