A nonassociative algebra having no finite basis for its laws

1978 ◽  
Vol 18 (6) ◽  
pp. 1007-1008 ◽  
Author(s):  
Yu. N. Mal'tsev ◽  
V. A. Parfenov



2003 ◽  
Vol 266 (2) ◽  
pp. 446-493
Author(s):  
Jiří Kad'ourek
Keyword(s):  


2000 ◽  
Vol 10 (04) ◽  
pp. 457-480 ◽  
Author(s):  
OLGA SAPIR

Let W be a finite language and let Wc be the closure of W under taking subwords. Let S(W) denote the Rees quotient of a free monoid over the ideal consisting of all words that are not in Wc. We call W finitely based if the monoid S(W) is finitely based. Although these semigroups have easy structure they behave "generically" with respect to the finite basis property [6]. In this paper, we describe all finitely based words in a two-letter alphabet. We also find some necessary and some sufficient conditions for a set of words to be finitely based.





1987 ◽  
Vol 48 (4) ◽  
pp. 298-302 ◽  
Author(s):  
Scott M. Farrand ◽  
David R. Finston






2012 ◽  
Vol 29 (3) ◽  
pp. 571-590 ◽  
Author(s):  
Jian Rong Li ◽  
Wen Ting Zhang ◽  
Yan Feng Luo


1990 ◽  
Vol 41 (1) ◽  
pp. 181-191 ◽  
Author(s):  
M. V. Volkov


Sign in / Sign up

Export Citation Format

Share Document