J. Almeida, Implicit operations on finite J-trivial semigroups and a conjecture of I. Simon, Journal of Pure and Applied Algebra, vol.69, pp.205-218, 1990.

J. Almeida, Finite semigroups and universal algebra, vol.3, 1995.

W. Czerwi?ski, W. Martens, T. Masopust, F. V. Fomin, R. Freivalds et al., Efficient separability of regular languages by subsequences and suffixes, International Colloquium on Automata, Languages and Programming (ICALP), vol.7966, pp.150-161, 2013.

W. Czerwi?ski, W. Martens, L. Van-rooijen, M. Zeitoun, and G. Zetzsche, A characterization for decidable separability by piecewise testable languages, Discrete Mathematics & Theoretical Computer Science, vol.19, issue.4, 2017.

G. Higman, Ordering by divisibility in abstract algebras, Proceedings of the London Mathematical Society, vol.3, issue.1, pp.326-336, 1952.

?. Holub, G. Jirásková, and T. Masopust, On upper and lower bounds on the length of alternating towers, Mathematical Foundations of Computer Science (MFCS), vol.8634, pp.315-326, 2014.

?. Holub, T. Masopust, and M. Thomazo, Alternating towers and piecewise testable separators, 2014.

?. Holub, T. Masopust, and M. Thomazo, On the height of towers of subsequences and prefixes, 2017.
URL : https://hal.archives-ouvertes.fr/hal-02269576

P. Karandikar, M. Kufleitner, and P. Schnoebelen, On the index of Simon's congruence for piecewise testability, Information Processing Letters, vol.115, issue.4, pp.515-519, 2015.

T. Masopust, Separability by piecewise testable languages is PTime-complete, Theoretical Computer Science, vol.711, pp.109-114, 2018.

T. Masopust, M. Krötzsch, A. M. Tjoa, L. Bellatreche, S. Biffl et al., Deciding universality of ptNFAs is PSpace-complete, International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM), 2018.

, LNCS, vol.10706, pp.413-427

T. Place, L. Van-rooijen, and M. Zeitoun, Separating regular languages by piecewise testable and unambiguous languages, Mathematical Foundations of Computer Science (MFCS), vol.8087, pp.729-740, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00948943

J. Stern, Characterizations of some classes of regular events, Theoretical Computer Science, vol.35, pp.17-42, 1985.