1. J. Almeida, Z. Ésik, and J. Pin. Commutative positive varieties of languages. Acta Cybernetica, 23(1):91–111, 2017.
2. S. Beier, M. Holzer, and M. Kutrib. On the descriptional complexity of operations on semilinear sets. In Proceedings 15th International Conference on Automata and Formal Languages, AFL 2017, Debrecen, Hungary, September 4-6, 2017., pages 41–55, 2017.
3. J. Berstel, L. Boasson, O. Carton, J. Pin, and A. Restivo. The expressive power of the shuffle product. Inf. Comput., 208(11):1258–1272, 2010.
4. J. Birget. Partial orders on words, minimal elements of regular languages and state complexity. Theor. Comput. Sci., 119(2):267–291, 1993.
5. D. S. Bridges, C. S. Calude, J. Gibbons, S. Reeves, and I. H. Witten, editors. First Conference of the Centre for Discrete Mathematics and Theoretical Computer Science, DMTCS 1996, Auckland, New Zealand, December, 9-13, 1996, 1996. Springer-Verlag, Singapore.