论文信息 - On semioirect products of two finite semilattices

On semioirect products of two finite semilattices

It is shown that a finite monoid M divides a semidirect product of two finite semilattices iff M satisfies the two following equations: (1) xuyvxy=xuyvyx and (2) xux=xux2. The proof rests on language theory and on a theorem of I. Simon on graph congruences.

Jean-Eric Pin | J. Pin

[1] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[2] Janusz A. Brzozowski,et al. Characterizations of locally testable events , 1973, Discret. Math..

[3] Denis Thérien,et al. Classification of Finite Monoids: The Language Approach , 1981, Theor. Comput. Sci..

[4] Samuel Eilenberg,et al. Automata, languages, and machines. A , 1974, Pure and applied mathematics.

[5] John Rhodes,et al. Decidability of complexity one-half for finite semigroups , 1982 .

[6] Jean-Eric Pin. Varietes de langages et monoide des parties , 1980 .

[7] G. Lallement. Semigroups and combinatorial applications , 1979 .

[8] H. Neumann. Varieties of Groups , 1967 .

[9] Jean-Éric Pin. Hiérarchies de Concaténation , 1984, RAIRO Theor. Informatics Appl..