This paper surveys the area of Free Burnside Semigroups. The theory of these semigroups, as is the case for groups, is far from being completely known. For semigroups, the most impressive results were obtained in the last 10 years. In this paper we give priority to the mathematical treatment of the problem and do not stress too much neither motivation nor the historical aspects. No proofs are presented in this paper, but we tried to give as many examples as was possible.
@article{ITA_2001__35_6_579_0, author = {Do Lago, Alair Pereira and Simon, Imre}, title = {Free burnside semigroups}, journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications}, pages = {579--595}, publisher = {EDP-Sciences}, volume = {35}, number = {6}, year = {2001}, mrnumber = {1922297}, zbl = {1061.20049}, language = {en}, url = {http://www.numdam.org/item/ITA_2001__35_6_579_0/} }
TY - JOUR AU - Do Lago, Alair Pereira AU - Simon, Imre TI - Free burnside semigroups JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications PY - 2001 SP - 579 EP - 595 VL - 35 IS - 6 PB - EDP-Sciences UR - http://www.numdam.org/item/ITA_2001__35_6_579_0/ LA - en ID - ITA_2001__35_6_579_0 ER -
%0 Journal Article %A Do Lago, Alair Pereira %A Simon, Imre %T Free burnside semigroups %J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications %D 2001 %P 579-595 %V 35 %N 6 %I EDP-Sciences %U http://www.numdam.org/item/ITA_2001__35_6_579_0/ %G en %F ITA_2001__35_6_579_0
Do Lago, Alair Pereira; Simon, Imre. Free burnside semigroups. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 35 (2001) no. 6, pp. 579-595. http://www.numdam.org/item/ITA_2001__35_6_579_0/
[1] The Burnside problem and identities in groups. Springer-Verlag, Berlin-New York, Ergebnisse der Mathematik und ihrer Grenzgebiete 95 [Results in Mathematics and Related Areas] (1979). Translated from the Russian by John Lennox and James Wiegold. | Zbl
,[2] The Burnside problem and identities in groups. Izdat. “Nauka”, Moscow (1975). | Zbl
,[3] Open problems about regular languages, edited by R.V. Book. Academic Press, New York, Formal Language Theory, Perspectives and Open Problems (1980) 23-47. | MR
,[4] Classification of non-counting events. J. Comput. System Sci. 5 (1971) 41-53. | MR | Zbl
, and ,[5] Characterizations of locally testable events. Discrete Math. 4 (1973) 243-271. | MR | Zbl
and ,[6] On an unsettled question in the theory of discontinuous groups. Quart. J. Math. 33 (1902) 230-238. | JFM
,[7] On non-counting regular classes, edited by M.S. Paterson, Automata, Languages and Programming. Springer-Verlag, Berlin, Lecture Notes in Comput. Sci. 443 (1990) 74-87. | Zbl
and ,[8] On non-counting regular classes. Theoret. Comput. Sci. 100 (1992) 67-104. | MR | Zbl
and ,[9] Local groups in free groupoids satisfying certain monoid identities (to appear). | Zbl
,[10] Sobre os semigrupos de Burnside , Master's Thesis. Instituto de Matemática e Estatística da Universidade de São Paulo (1991).
,[11] On the Burnside semigroups , in LATIN'92, edited by I. Simon. Springer-Verlag, Berlin, Lecture Notes in Comput. Sci. 583 (1992) 329-343.
,[12] On the Burnside semigroups . Int. J. Algebra Comput. 6 (1996) 179-227. | MR | Zbl
,[13] Grupos Maximais em Semigrupos de Burnside Livres, Ph.D. Thesis. Universidade de São Paulo (1998). Electronic version at http://www.ime.usp.br/~alair/Burnside/
,[14] Maximal groups in free Burnside semigroups, in LATIN'98, edited by C.L. Lucchesi and A.V. Moura. Springer-Verlag, Berlin, Lecture Notes in Comput. Sci. 1380 (1998) 70-81. | Zbl
,[15] Automata, languages, and machines, Vol. B. Academic Press [Harcourt Brace Jovanovich Publishers], New York (1976). With two chapters (“Depth decomposition theorem” and “Complexity of semigroups and morphisms”) by B. Tilson, Pures Appl. Math. 59. | Zbl
,[16] On semigroups in which . Proc. Cambridge. Philos. Soc. 48 (1952) 35-40. | MR | Zbl
and ,[17] The word problem for the relatively free semigroup satisfying with . Int. J. Algebra Comput. 2 (1993) 335-348. | MR | Zbl
,[18] The word problem for the relatively free semigroup satisfying with or . Int. J. Algebra Comput. 2 (1993) 125-140. | MR | Zbl
,[19] Solution of the Burnside problem for exponent six. Illinois J. Math. 2 (1958) 764-786. | MR | Zbl
,[20] Equations and rewrite rules: A survey, edited by R.V. Book. Academic Press, New York, Formal Language Theory, Perspectives and Open Problems (1980) 349-405.
and ,[21] The free Burnside groups of sufficiently large exponents. Int. J. Algebra Comput. 4 (1994) ii+308. | MR | Zbl
,[22] On free semigroups satisfying . Simon Stevin 64 (1990) 3-19. | MR | Zbl
and ,[23] Term rewriting systems: From Church-Rosser to Knuth-Bendix and beyond, edited by M.S. Paterson, Automata, Languages and Programming. Springer-Verlag, Berlin, Lecture Notes in Comput. Sci. 443 (1990) 350-369. | Zbl
,[24] Semigroups and Combinatorial Applications. John Wiley & Sons, New York (1979). | MR | Zbl
,[25] Über eine besondere Klasse von Gruppen. Abh. Math. Sem. Hamburg 9 (1933) 154-158. | JFM
and ,[26] Infinity of Burnside groups of period for . Uspekhi Mat. Nauk 47 (1992) 201-202. | MR | Zbl
,[27] Categories for the working mathematician. Springer-Verlag, New York, Grad. Texts in Math. 5 (1971). | MR | Zbl
,[28] The solution to the word problem for the relatively free semigroups satisfying with . Int. J. Algebra Comput. 1 (1991) 1-32. | MR | Zbl
,[29] Idempotent semigroups. Amer. Math. Monthly 61 (1954) 110-113. | MR | Zbl
,[30] Infinite periodic groups. I. Izv. Akad. Nauk SSSR Ser. Mat. 32 212-244. | MR | Zbl
and ,[31] Infinite periodic groups. II. Izv. Akad. Nauk SSSR Ser. Mat. 32 (1968) 251-524. | MR | Zbl
and ,[32] Geometry of defining relations in groups. Kluwer Academic Publishers Group, Dordrecht (1991). Translated from the 1989 Russian original by Yu.A. Bakhturin. | Zbl
,[33] Solution of Burnside’s problem for exponent . Leningrad. Gos. Univ. Uchen. Zap. Ser. Mat. 10 (1940) 166-170 (Russian). | Zbl
,[34] Notes on non-counting languages of order . Manuscript (1970).
,[35] Finite automata, formal logic, and circuit complexity. Birkhäuser Boston Inc., Boston, MA (1994). | MR | Zbl
,[36] Über die gegenseitige Lage gleicher Teile gewisser Zeichenreihen. Norske Vid. Selsk. Skr. I Mat. Nat. Kl. 1 (1912) 1-67. | JFM
,[37] Categories as algebra: An essential ingredient in the theory of monoids. J. Pure Appl. Algebra 48 (1987) 83-198. | MR | Zbl
,