On the finite basis problem for certain 2limited words
 Jian Rong Li,
 Wen Ting Zhang,
 Yan Feng Luo
 … show all 3 hide
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
Get AccessAbstract
Let X* be a free monoid over an alphabet X and W be a finite language over X. Let S(W) be the Rees quotient X*/I(W), where I(W) is the ideal of X* consisting of all elements of X* that are not subwords of W. Then S(W) is a finite monoid with zero and is called the discrete syntactic monoid of W. W is called finitely based if the monoid S(W) is finitely based. In this paper, we give some sufficient conditions for a monoid to be nonfinitely based. Using these conditions and other results, we describe all finitely based 2limited words over a threeelement alphabet. Furthermore, an explicit algorithm is given to decide that whether or not a 2limited word in which there are exactly two nonlinear letters is finitely based.
 McKenzie, R. (1996) Tarski’s finite basis problem is undecidable. Internat. J. Algebra Comput. 6: pp. 49104 CrossRef
 Edmunds, C. C. (1977) On certain finitely based varieties of semigoups. Semigroup Forum 15: pp. 2139 CrossRef
 Edmunds, C. C. (1980) Varieties generated by semigroups of order four. Semigroup Forum 21: pp. 6781 CrossRef
 Jackson, M. (2000) Finite semigroups whose varieties have uncountably many subvarieties. J. Algebra 228: pp. 512535 CrossRef
 Lee, E. W. H. (2006) Subvarieties of the variety generated by the fiveelement Brandt semigroup. Internat. J. Algebra Comput. 16: pp. 417441 CrossRef
 Lee, E. W. H. (2004) Identity bases for some nonexact varieties. Semigroup Forum. 68: pp. 445457 CrossRef
 Perkins, P. (1969) Bases for equational theories of semigroups. J. Algebra 11: pp. 298314 CrossRef
 Sapir, O. (2000) Finitely based words. Internat. J. Algebra Comput. 10: pp. 457480
 Volkov, M. V. (2001) The finite basis problem for finite semigroups. Sci. Math. Jpn. 53: pp. 171199
 Zhang, W. T., Luo, Y. F. (2009) The subvariety lattice of the join of two semigroup varieties. Acta Mathematica Sinica, English Series 25: pp. 971982 CrossRef
 Jackson, M., Sapir, O. (2000) Finitely based, finite sets of words. Internat. J. Algebra Comput. 10: pp. 683708
 Jackson, M. (2001) On the finite basis problem for finite Rees quotients of free monoids. Acta Sci. Math. (Szeged) 67: pp. 121159
 Shevrin, L. N., Volkov, M. V. (1985) Identities of semigroups (in Russian). Izv. Vyssh. Uchebn. Zaved. Mat. 11: pp. 347
 Burris, S., Sankappanavar, H. P. (1981) A Course in Universal Algebra. SpringerVerlag, New York CrossRef
 Howie, J. M. (1995) Fundamentals of Semigroup Theory. Charendon Press, Oxford
 Jackson, M. (2005) Finiteness properties of varieties and the restriction to finite algebras. Semigroup Forum 70: pp. 159187 CrossRef
 Jackson, M. (2005) Finite semigroups with infinite irredundant identity bases. Internat. J. Algebra Comput. 15: pp. 405422 CrossRef
 Title
 On the finite basis problem for certain 2limited words
 Journal

Acta Mathematica Sinica, English Series
Volume 29, Issue 3 , pp 571590
 Cover Date
 20130301
 DOI
 10.1007/s1011401201931
 Print ISSN
 14398516
 Online ISSN
 14397617
 Publisher
 Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
 Additional Links
 Topics
 Keywords

 Finite basis problem
 2limited words
 discrete syntactic monoid
 20M07
 08B05
 Authors

 Jian Rong Li ^{(1)}
 Wen Ting Zhang ^{(1)}
 Yan Feng Luo ^{(1)}
 Author Affiliations

 1. Department of Mathematics, Lanzhou University, Lanzhou, 730000, P. R. China