A generalization of the Schützenberger product of finite monoids. (English) Zbl 0456.20048


20M35 Semigroups in automata theory, linguistics, etc.
20M05 Free semigroups, generators and relations, word problems
68T99 Artificial intelligence
Full Text: DOI


[1] Brzozowski, J.A., Hierarchies of aperiodic languages, Rev. automat. informat. recherche opérationelle, 10, 33-49, (1976)
[2] Brzozowski, J.A.; Knast, R., The dot-depth hierarchy of star-free languages is infinite, J. comput. system sci., 16, 37-55, (1978) · Zbl 0368.68074
[3] Clifford, A.H.; Preston, G.B., The algebraic theory of semigroups, Vol. 1, (1961), American Mathematical Society Providence, RI · Zbl 0111.03403
[4] Cohen, R.S.; Brzozowski, J.A., Dot-depth of star-free events, J. comput. system sci., 5, 1-15, (1971) · Zbl 0217.29602
[5] Eilenberg, S., Automata, languages and machines, Vol. B, (1976), Academic Press New York
[6] Knast, R., Semigroup characterizations of dot-depth one languages, (1975), Institute of Mathematics, Polish Academy of Sciences
[7] Krohn, K.B.; Rhodes, J.; Tilson, B., (), Ch. 1-5
[8] Schützinberger, M.P., On finite monoids having only trivial subgroups, Information and control, 8, 190-194, (1965) · Zbl 0131.02001
[9] Schützenberger, M.P., Sur le produit de concatenation non ambigu, Semigroup forum, 13, 47-75, (1976) · Zbl 0373.20059
[10] Simon, I., Piecewise testable events, () · Zbl 0316.68034
[11] Straubing, H., Varieties of recognizable sets whose syntactic monoids contain solvable groups, ()
[12] H. Straubing, A periodic homomorphisms and the concatenation product of recognizable sets, J. Pure Appl. Algebra. · Zbl 0407.20056
[13] Tilson, B., Automata, languages and machines, Vol. B, (1976), Academic Press New York, Ch. XI and XII
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. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.