J. Brzozowski, G. Jirásková, and B. Li, Quotient complexity of ideal languages, Theoretical Computer Science, vol.470, pp.36-52, 2013.
DOI : 10.1016/j.tcs.2012.10.055

C. Câmpeanu, K. Salomaa, and S. Yu, Tight lower bound for the state complexity of shuffle of regular languages, J. Autom. Lang. Comb, vol.7, issue.3, pp.303-310, 2002.

G. The and . Group, GAP ? Groups, Algorithms, and Programming, Version 4, 2016.

A. Okhotin, On the state complexity of scattered substrings and superstrings. Fund, Inform, vol.99, issue.3, pp.325-338, 2010.

E. Sperner, Ein Satz ???ber Untermengen einer endlichen Menge, Mathematische Zeitschrift, vol.27, issue.1, pp.544-548, 1928.
DOI : 10.1007/BF01171114

S. Yu, State complexity of regular languages, J. Autom. Lang. Comb, vol.6, pp.221-234, 2001.