Abstract
The block product of monoids is a bilateral version of the better known wreath product. Unlike the wreath product, block product is not associative. All decomposition theorems based on iterated block products that have appeared until now have assumed right-to-left bracketing of the operands. We here study what happens when the bracketing is made left-to-right. This parenthesization is in general weaker than the traditional one. We show that weakly iterated block products of semilattices correspond exactly to the well-known variety DA of finite monoids: if groups are allowed as factors, the variety DA*G is obtained. These decomposition theorems allow new, simpler, proofs of recent results concerning the defining power of generalized first-order logic using two variables only.
contact author: School of Computer Science, McGill University, 3480 University, Montréal, QC, Canada, H3A 2A7. Research supported by NSERC, FCAR and the Von Humboldt Foundation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S. Eilenberg, Automata, Languages and Machines, vol. B, Academic Press, New York, 1976.
J. E. Pin, Varieties of Formal Languages, Plenum, London, 1986.
J. Rhodes and B. Tilson, “The Kernel of Monoid Morphisms”, J. Pure and Applied Algebra 62 (1989) 227–268.
M. P. Schützenberger, “On finite monoids having only trivial subgroups”, Information and Control 8 (1965) 190–194.
M. P. Schützenberger, “A remark on finite transducers”, Information and Control 4 (1961), 185–196.
M. P. Schützenberger, “Sur le Produit de Concatenation Non-ambigu”, Semigroup Forum 13 (1976), 47–76.
P. Stiffler, “Extensions of the Fundamental Theorem of Finite Semigroups”, Advances in Mathematics, 11 159–209 (1973).
H. Straubing and D. Thérien, “Regular languages defined by generalized first-order formulas with a bounded number of bound variables”, Proc. 18th Symposium on Theoretical Aspects of Computer Science 551–562 (2001).
H. Straubing, Finite Automata, Formal Logic and Circuit Complexity, Birkhäuser, Boston, 1994.
D. Thérien, “Two-sided wreath products of categories”, J. Pure and Applied Algebra 74 (1991) 307–315.
D. Thérien and T. Wilke, “Over Words, Two Variables are as Powerful as One Quantifier Alternation,” Proc. 30th ACM Symposium on the Theory of Computing 256–263 (1998).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Straubing, H., Thérien, D. (2002). Weakly Iterated Block Products of Finite Monoids. In: Rajsbaum, S. (eds) LATIN 2002: Theoretical Informatics. LATIN 2002. Lecture Notes in Computer Science, vol 2286. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45995-2_13
Download citation
DOI: https://doi.org/10.1007/3-540-45995-2_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43400-9
Online ISBN: 978-3-540-45995-8
eBook Packages: Springer Book Archive