Graph congruences and wreath products. (English) Zbl 0559.20042

Authors’ summary: ”Results on graph congruences have recently been used to decide membership in varieties defined by wreath products. The general technique for doing so is explained. In particular an efficient algorithm is obtained for deciding when a semigroup divides a wreath product of a commutative monoid with a locally trivial semigroup.”
Reviewer: I.Peák


20M07 Varieties and pseudovarieties of semigroups
20M15 Mappings of semigroups
20M35 Semigroups in automata theory, linguistics, etc.
Full Text: DOI


[1] Berge, C., Theory of Graphs and its Applications (1958), Wiley: Wiley New York
[2] Eilenberg, S., Automata, (Languages and Machines, Vol. B (1976), Academic Press: Academic Press New York) · Zbl 0175.27902
[3] Knast, R., A semigroup characterization of doth-depth one languages, Rev. Aut. Inf. Rech. Op. (1983), to appear
[4] Knast, R., Periodic local testability (1978), Unpublished manuscript
[5] Rhodes, J., Infinite iteration of matrix semigroups (1983), Center for Pure and Applied Mathematics, University of California at Berkeley, Part II, PAM-121
[6] Pin, J.-E., On semidirect product of two finite semilattices (1982), Unpublished Manuscript
[7] Straubing, H., Finite semigroup varieties of the form VD, J. Pure Appl. Algebra, 36, 53-94 (1985) · Zbl 0561.20042
[8] B. Tilson, Chapter XI and XII in [2].; B. Tilson, Chapter XI and XII in [2].
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.