Some results on the dot-depth hierarchy |
| |
Authors: | Pascal Weil |
| |
Institution: | (1) LITP-Institut Blaise Pascal, 4 place Jussieu, 75252 Paris Cedex 05, France |
| |
Abstract: | In this paper we pursue the study of the decidability of the dot-depth hierarchy. We give an effective lower bound for the dotdepth of an aperiodic monoid. The main tool for this is the study of a certain operation on varieties of finite monoids in terms of Mal'cev product. We also prove the equality of two decidable varieties which were known to contain all dot-depth two monoids. Finally, we restrict our attention to inverse monoids, and we prove that the class of inverse dot-depth two monoids is locally finite. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|