The globals of pseudovarieties of ordered semigroups containing B 2 and an application to a problem proposed by Pin
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 39 (2005) no. 1, pp. 1-29.

Given a basis of pseudoidentities for a pseudovariety of ordered semigroups containing the 5-element aperiodic Brandt semigroup B 2 , under the natural order, it is shown that the same basis, over the most general graph over which it can be read, defines the global. This is used to show that the global of the pseudovariety of level 3/2 of Straubing-Thérien’s concatenation hierarchy has infinite vertex rank.

DOI : 10.1051/ita:2005001
Classification : 20M05, 20M07, 20M35
Mots-clés : semigroup, pseudovariety, semigroupoid, category, pseudoidentity, dot-depth, concatenation hierarchies 
@article{ITA_2005__39_1_1_0,
     author = {Almeida, Jorge and Escada, Ana P.},
     title = {The globals of pseudovarieties of ordered semigroups containing $B_2$ and an application to a problem proposed by {Pin}},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {1--29},
     publisher = {EDP-Sciences},
     volume = {39},
     number = {1},
     year = {2005},
     doi = {10.1051/ita:2005001},
     mrnumber = {2132576},
     zbl = {1079.20074},
     language = {en},
     url = {http://archive.numdam.org/articles/10.1051/ita:2005001/}
}
TY  - JOUR
AU  - Almeida, Jorge
AU  - Escada, Ana P.
TI  - The globals of pseudovarieties of ordered semigroups containing $B_2$ and an application to a problem proposed by Pin
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 2005
SP  - 1
EP  - 29
VL  - 39
IS  - 1
PB  - EDP-Sciences
UR  - http://archive.numdam.org/articles/10.1051/ita:2005001/
DO  - 10.1051/ita:2005001
LA  - en
ID  - ITA_2005__39_1_1_0
ER  - 
%0 Journal Article
%A Almeida, Jorge
%A Escada, Ana P.
%T The globals of pseudovarieties of ordered semigroups containing $B_2$ and an application to a problem proposed by Pin
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 2005
%P 1-29
%V 39
%N 1
%I EDP-Sciences
%U http://archive.numdam.org/articles/10.1051/ita:2005001/
%R 10.1051/ita:2005001
%G en
%F ITA_2005__39_1_1_0
Almeida, Jorge; Escada, Ana P. The globals of pseudovarieties of ordered semigroups containing $B_2$ and an application to a problem proposed by Pin. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 39 (2005) no. 1, pp. 1-29. doi : 10.1051/ita:2005001. http://archive.numdam.org/articles/10.1051/ita:2005001/

[1] J. Almeida, Hyperdecidable pseudovarieties and the calculation of semidirect products. Int. J. Algebra Comput. 9 (1999) 241-261. | Zbl

[2] J. Almeida, A syntactical proof of locality of DA. Int. J. Algebra Comput. 6 (1996) 165-177. | Zbl

[3] J. Almeida, Finite Semigroups and Universal Algebra. World Scientific, Singapore (1995). English translation. | MR | Zbl

[4] J. Almeida, Finite semigroups: an introduction to a unified theory of pseudovarieties, in Semigroups, Algorithms, Automata and Languages, edited by G.M.S. Gomes, J.-E. Pin and P.V. Silva. World Scientific, Singapore (2002) 3-64. | Zbl

[5] J. Almeida, A. Azevedo and L. Teixeira, On finitely based pseudovarieties of the forms V*D and V*D n . J. Pure Appl. Algebra 146 (2000) 1-15. | Zbl

[6] J. Almeida and A. Azevedo, Globals of commutative semigroups: the finite basis problem, decidability, and gaps. Proc. Edinburgh Math. Soc. 44 (2001) 27-47. | Zbl

[7] J. Almeida and P. Weil, Profinite categories and semidirect products. J. Pure Appl. Algebra 123 (1998) 1-50. | Zbl

[8] M. Arfi, Polynomial operations and rational languages, 4th STACS. Lect. Notes Comput. Sci. 247 (1991) 198-206. | Zbl

[9] M. Arfi, Opérations polynomiales et hiérarchies de concaténation. Theor. Comput. Sci. 91 (1991) 71-84. | Zbl

[10] J.A. Brzozowski, Hierarchies of aperiodic languages. RAIRO Inform. Théor. 10 (1976) 33-49.

[11] J.A. Brzozowski and R. Knast, The dot-depth hierarchy of star-free languages is infinite. J. Comp. Syst. Sci. 16 (1978) 37-55. | Zbl

[12] J.A. Brzozowski and I. Simon, Characterizations of locally testable events. Discrete Math. 4 (1973) 243-271. | Zbl

[13] S. Eilenberg, Automata, Languages and Machines, Vol. B. Academic Press, New York (1976). | MR | Zbl

[14] K. Henckell and J. Rhodes, The theorem of Knast, the PG=BG and type II conjecture, in Monoids and Semigroups with Applications, edited by J. Rhodes. World Scientific (1991) 453-463. | Zbl

[15] P. Jones, Profinite categories, implicit operations and pseudovarieties of categories. J. Pure Applied Algebra 109 (1996) 61-95. | Zbl

[16] R. Knast, A semigroup characterization of dot-depth one languages. RAIRO Inform. Théor. 17 (1983) 321-330. | Numdam | Zbl

[17] R. Knast, Some theorems on graphs congruences. RAIRO Inform. Théor. 17 (1983) 331-342.

[18] M.V. Lawson, Inverse Semigroups: the Theory of Partial Symmetries. World Scientific, Singapore (1998). | MR | Zbl

[19] S.W. Margolis and J.-E. Pin, Product of group languages, FCT Conference. Lect. Notes Comput. Sci. 199 (1985) 285-299. | Zbl

[20] R. Mcnaughton, Algebraic decision procedures for local testability. Math. Systems Theor. 8 (1974) 60-76. | Zbl

[21] J.-E. Pin, A variety theorem without complementation. Izvestiya VUZ Matematika 39 (1985) 80-90. English version, Russian Mathem. (Iz. VUZ) 39 (1995) 74-83. | Zbl

[22] J.-E. Pin, Syntactic Semigroups, Chapter 10 in Handbook of Formal Languages, edited by G. Rosenberg and A. Salomaa, Springer (1997). | MR

[23] J.-E. Pin, Bridges for concatenation hierarchies, in 25th ICALP, Berlin. Lect. Notes Comput. Sci. 1443 (1998) 431-442. | Zbl

[24] J.-E. Pin and H. Straubing, Monoids of upper triangular matrices, Colloquia Mathematica Societatis Janos Boylai 39, Semigroups, Szeged (1981) 259-272. | Zbl

[25] J.-E. Pin and P. Weil, A Reiterman theorem for pseudovarieties of finite first-order structures. Algebra Universalis 35 (1996) 577-595. | Zbl

[26] J.-E. Pin and P. Weil, Polynomial closure and unambiguous product. Theory Comput. Syst. 30 (1997) 1-39. | Zbl

[27] J.-E. Pin, A. Pinguet and P. Weil, Ordered categories and ordered semigroups. Comm. Algebra 30 (2002) 5651-5675. | Zbl

[28] N. Reilly, Free combinatorial strict inverse semigroups. J. London Math. Soc. 39 (1989) 102-120. | Zbl

[29] J. Reiterman, The Birkhoff theorem for finite algebras. Algebra Universalis 14 (1982) 1-10. | Zbl

[30] I. Simon, Piecewise testable events, in Proc. 2th GI Conf., Lect. Notes Comput. Sci. 33 (1975) 214-222. | Zbl

[31] I. Simon, The product of rational languages, in Proc. ICALP 1993, Lect. Notes Comput. Sci. 700 (1993) 430-444.

[32] H. Straubing, A generalization of the Schützenberger product of finite monoids. Theor. Comp. Sci. 13 (1981) 137-150. | Zbl

[33] H. Straubing, Finite semigroup varieties of the form V*D. J. Pure Appl. Algebra 36 (1985) 53-94. | Zbl

[34] H. Straubing, Semigroups and languages of dot-depth two. Theor. Comput. Sci. 58 (1988) 361-378. | Zbl

[35] H. Straubing and P. Weil, On a conjecture concerning dot-depth two languages. Theor. Comput. Sci. 104 (1992) 161-183. | Zbl

[36] D. Thérien and A. Weiss, Graph congruences and wreath products. J. Pure Appl. Algebra 36 (1985) 205-215. | Zbl

[37] B. Tilson, Categories as algebras: an essential ingredient in the theory of monoids. J. Pure Appl. Algebra 48 (1987) 83-198. | Zbl

[38] P. Weil, Some results on the dot-depth hierarchy. Semigroup Forum 46 (1993) 352-370. | Zbl

Cité par Sources :