1. Kondacs, A., Watrous, J.: On the power of quantum finite state automata. In: 38th Annual Symposium on Foundations of Computer Science, FOCS 1997, Miami Beach, Florida, USA, 19–22 October 1997, pp. 66–75 (1997). http://dx.doi.org/10.1109/SFCS.1997.646094
2. Shallit, J., Wang, M.-W.: Automatic complexity of strings. J. Autom. Lang. Comb. 6(4), 537–554 (2001). 2nd Workshop on Descriptional Complexity of Automata, Grammars and Related Structures, London, ON, 2000
3. Kjos-Hanssen, B.: Few paths, fewer words: model selection with automatic structure functions. Exp. Math. (2018). Conditionally accepted. arXiv:1608.01399
4. Kjos-Hanssen, B.: Shift registers fool finite automata. ArXiv e-prints, July 2016
5. Shen, A.: Automatic Kolmogorov complexity and normality revisited. ArXiv e-prints, January 2017