A general finite basis condition for systems of semigroup identities

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



1984 ◽  
Vol 28 (1) ◽  
pp. 93-99 ◽  
Author(s):  
M. V. Volkov




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.





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


2016 ◽  
Vol 26 (05) ◽  
pp. 985-1017
Author(s):  
Olga B. Finogenova

We study varieties of associative algebras over a finite field and varieties of associative rings satisfying semigroup or adjoint semigroup identities. We characterize these varieties in terms of “forbidden algebras” and discuss some corollaries of the characterizations.







Sign in / Sign up

Export Citation Format

Share Document