Ordered monoids and \(\mathcal J\)-trivial monoids (Q4942271)

In this paper a new proof of a theorem of \textit{H. Straubing} and \textit{D. Thérien} [J. Algebra 119, No. 2, 393-399 (1988; Zbl 0658.20035)] is given, which states that every \(\mathcal J\)-trivial monoid \(M\) is a quotient of a partially ordered monoid whose identity is the greatest element. Thus, also a new proof of \textit{I. Simon}'s theorem [Lect. Notes Comput. Sci. 33, 214-222 (1975; Zbl 0316.68034)] that a recognizable language is piecewise testable if and only if its syntactic monoid is \(\mathcal J\)-trivial, is provided. While the original proof by Straubing-Thérien proceeded by induction (on two pages), the new proof provides a direct construction of the covering monoid. Using the concept of factorization tree it goes as follows: for a set \(A\) of generators of \(M\) a preorder \(\leq\) is defined on \(A^*\) such that the equivalence \(\sim\) associated with \(\leq\) is a congruence of finite index on \(A^*\); the required cover is then the monoid \(A^*/\sim\) endowed with the partial order induced by \(\leq\). For the entire collection see [Zbl 0931.00032].