[1]
J. Brzozowski, G. Jir´askov´a, B. Li, and J. Smith, “Quotient complexity of bifix-, factor-, and subword-free regular languages”, Acta Cybern, vol. 21, no. 4, pp. 507–527, Jan. 2014.