The wreath product principle for ordered semigroups

Communications in Algebra

Volumn 30, Issue 12, 2002, Pages 5677-5713

  Pin, Jean Eric ^a   Weil, Pascal ^b  

^a UNIVERSITÉ PARIS DIDEROT   (France)

^b UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036950894     PISSN: 00927872     EISSN: None     Source Type: Journal    
DOI: 10.1081/AGB-120016005     Document Type: Article

References (22)

1. Almeida J.; Weil, P. Free Profinite Semigroups Over Semidirect Products, Izvestiya VUZ Matematika 1995, 39, 3-31. English Version, Russian Mathem. (Iz. VUZ.) 1995, 39, 1-28.
2. Brzozowski, J.A.; Simon, I. Characterizations of Locally Testable Languages. Discrete Math. 1973, 4, 243-271.
3. Cohen, R.S.; Brzozowski, J.A. On Star-free Events. Proc. Hawaii Int. Conf. on System Science, Honolulu 1968, 1-4.
4. Cohen, J.; Perrin, D.; Pin, J.-E. On the Expressive Power of Temporal Logic. J. Comput. System Sci. 1993, 46, 271-294.
5. Eilenberg, S. Automata, Languages and Machines; Vol. B, Academic Press: New York, 1976.
6. Emery, S. Varieties and Pseudovarieties of Ordered Normal Bands. Semigroup Forum 1999, 58, 348-366.
7. Glaßer, C.; Schmitz, H. Languages of Dot-depth 3/2. Proceedings 17th Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, Springer Verlag: 1770, 2000; 555-566.
8. Knast, R. A Semigroup Characterization of Dot-depth One Languages. RAIRO Inform. Théor. 1983, 17, 321-330.
9. Knast, R. Some Theorems on Graph Congruences. RAIRO Inform. Théor. 1983, 17, 331-342.
10. McNaughton, R. Algebraic Decision Procedures for Local Testability. Math. Syst. Theor. 1974, 8, 60-76.
11. Meyer, A.R. A Note on Star-free Events. J. Assoc. Comput. Mach. 1969, 16, 220-225.
12. Pin, J.-E. Variétés de Langages Formels; Masson Paris, 1984; English translation: Varieties of Formal Languages; Plenum: New-York, 1986.
13. Pin, J.-E. A Variety Theorem Without Complementation. Izvestiya VUZ Matematika 1995, 39, 80-90. English version. Russian Mathem. (Iz. VUZ) 1995, 39, 74-83.
14. Pin, J.-E. Syntactic Semigroups, Chapter 10 in Handbook of Formal Languages; Rozenberg, G., Salomaa, A., Eds.; Springer, 1997.
15. Pin, J.-E.; Pinguet, A.; Weil, P. Ordered Categories and Ordered Semigroups. Communications in Algebra 2000, 30, 5651-5675.
16. Pin, J.-E.; Weil, P. Polynomial Closure and Unambiguous Product. Theory Comput. Systems 1997, 30, 1-39.
17. Pin, J.-E.; Weil, P. Semidirect Products of Ordered Semigroups, Communications in Algebra 2002, 30, 149-169.
18. Simon, I. Piecewise Testable Events. Proc. 2nd GI Conf., Lect. Notes in Comp. Sci. 33, Springer: Berlin, 1975; 214-222.
19. Straubing, H. Families of Recognizable Sets Corresponding to Certain Varieties of Finite Monoids. J. Pure Appl. Algebra 1979, 15, 305-318.
20. Straubing, H. Finite Semigroups Varieties of the Form V * D. J. Pure Appl. Algebra 1985, 36, 53-94.
21. Straubing, H. The Wreath Product and its Application. In Formal Properties of Finite Automata and Applications; Pin, J.-E., Ed.; Lect. Notes in Comp. Sci. 386, Springer Verlag: Berlin, Heidelberg, New York, 1989; 15-24.
22. Wilke, T. Classifying Discrete Temporal Properties, STACS 99, Meinel, Ch., Tison, S., Eds.; Lect. Notes in Comput. Sci. 1563, Springer-Verlag: Berlin, 1999; 32-46.