Weakly Iterated Block Products of Finite Monoids
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.
Unable to display preview. Download preview PDF.
- 8.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).Google Scholar
- 9.H. Straubing, Finite Automata, Formal Logic and Circuit Complexity, Birkhäuser, Boston, 1994.Google Scholar
- 11.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).Google Scholar