1. Gruber, H., Holzer, M.: Results on the average state and transition complexity of finite automata accepting finite languages (extended abstract). In: Leung, H., Pighizzini, G. (eds.) 8th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2006, Las Cruces, New Mexico, USA, June 21 - 23, 2006 Proceedings. New Mexico State University, Las Cruces, New Mexico, USA, pp 267–275 (2006)
2. Gruber, H., Holzer, M.: On the average state and transition complexity of finite languages. Theoret. Comput. Sci. 387(2), 155–166 (2007)
3. Hyde, K.K., Kjos-Hanssen, B.: Nondeterministic automatic complexity of overlap-free and almost square-free words. Electron. J. Combin. 22(3), 3.22, 18 (2015)
4. OEIS Foundation Inc: The on-line encyclopedia of integer sequences http://oeis.org/A005187 (2021)
5. Ishigami, Y., Sei’ichi, T.: The VC-Dimensions of Finite Automata with N States. In: Algorithmic Learning Theory (Tokyo, 1993), volume 744 of Lecture Notes in Comput Sci, pp 328–341. Springer, Berlin (1993)