Abstract
In this paper we give a new proof of the following result of Straubing and Thérien: Every J-trivial monoid is a quotient of an ordered monoid satisfying the identity x ≤ 1.
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
J. Almeida, Implicit operations on finite J-trivial semigroups and a conjecture of I. Simon, J. Pure AppL Algebra, 69 (1990), 205-218.
J. Almeida, Finite Semigroups and Universal Algebra, Ser. in Algebra 3, World Scientific, Singapore, 1994.
C.J. Ash, Finite semigroups with commuting idempotents, J. Austral. Math. Soc. Ser. A, 43 (1987), 81-90.
C.J. Ash, Inevitable sequences and a proof of the type II conjecture, in Proceedings of the Monash Conference on Semigroup Theory, World Scientific, Singapore, 1991, 31-42.
C.J. Ash, Inevitable graphs: A proof of the type II conjecture and some related decision procedures, Internat. J. Algebra Comput., 1 (1991), 127-146.
K. Henckell, Blockgroups power groups, in Proceedings of the Monash Conference on Semigroup Theory, World Scientific, Singapore, 1991,117-134.
K. Henckell, S.W. Margolis, J.-E. Pin, and J. Rhodes, Ash’s type II theorem, profinite topology and Malcev products, Internat. J. Algebra Comput., 1 (1991), 411-436.
K. Henckell and J. Rhodes, The theorem of Knast, the PG = BG and type II conjectures, in Monoids and Semigroups with Applications, J. Rhodes,ed., Word Scientific, Singapore, 1991, 453-463.
R. Knast, A semigroup characterization of dot-depth one languages, RAIRO Inform. Thé or. Appl., 17 (1983), 321-330.
R. Knast, Some theorems on graph congruences, RAIROInform. Théor. AppL, 17 (1983), 331-342.
J.E. Pin, A variety theorem without complementation, Izv. Vyssh. Uchebn. Zaved. Mat., 39 (1995), 80-90; Russian Math. (Iz. VUZ), 39 (1995), 74-83 (English translation).
J.E. Pin, BG PG, a success story, in Semigroups,Formal Languages and Groups, J. Fountain, ed., NATO Adv. Sci. Inst. Ser. C Math. Phys. Sci., Kluwer Academic Publishers, Dordrecht, the Netherlands, 1995, 33-47.
J.E. Pin and P. Weil, Polynomial closure and unambiguous product, Theory Comput. Systems, 30 (1997), 1-39.
J. E. Pin and P. Weil, Semidirect product of ordered monoids, in preparation.
J. E. Pin and P. Weil, The wreath product principle for ordered semigroups, in preparation.
I. Simon, Piecewise testable events, in Proceedings of the Second GI Conference, Lecture Notes in Comput. Sci. 33, Springer-Verlag, Berlin, New York, Heidelberg, 1975, 214-222.
I. Simon, Properties of factorization forests, in Formal Properties of Finite Automata and Applications, J.E. Pin, ed., Lecture Notes in Comput. Sci. 386, Springer-Verlag, Berlin, New York, Heidelberg, 1989, 34-55.
I. Simon, Factorization forests of finite height, Theoret. Comput. Sci., 72 (1990), 65-94. Ordered Monoids and J-Trivial Monoids 137
I. Simon, A short proof of the factorization forest theorem, in Tree Automata and Languages, M. Nivat and A. Podelski, eds., Elsevier Science, Amsterdam, 1992, 433-438.
H. Straubing and D. Thérien, Partially ordered finite monoids and a theorem of I. Simon, J. Algebra, 119 (1985), 393-399.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media New York
About this paper
Cite this paper
Henckell, K., Pin, JE. (2000). Ordered Monoids and J-Trivial Monoids. In: Birget, JC., Margolis, S., Meakin, J., Sapir, M. (eds) Algorithmic Problems in Groups and Semigroups. Trends in Mathematics. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4612-1388-8_6
Download citation
DOI: https://doi.org/10.1007/978-1-4612-1388-8_6
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-1-4612-7126-0
Online ISBN: 978-1-4612-1388-8
eBook Packages: Springer Book Archive