1. Ang, T., Brzozowski, J.A.: Languages convex with respect to binary relations, and their closure properties. Acta Cybern. 19(2), 445–464 (2009). https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3776
2. Bordihn, H., Holzer, M., Kutrib, M.: Determination of finite automata accepting subregular languages. Theor. Comput. Sci. 410(35), 3209–3222 (2009). https://doi.org/10.1016/j.tcs.2009.05.019
3. Brzozowski, J., Jirásková, G., Li, B., Smith, J.: Quotient complexity of bifix-, factor-, and subword-free regular languages. Acta Cybern. 21(4), 507–527 (2014). https://doi.org/10.14232/actacyb.21.4.2014.1
4. Brzozowski, J.A.: Canonical regular expressions and minimal state graphs for definite events. In: Proceedings of Symposium on Mathematical Theory of Automata. MRI Symposia Series, vol. 12, pp. 529–561. Polytechnic Press, New York (1962)
5. Brzozowski, J.A.: Roots of star events. J. ACM 14(3), 466–477 (1967). https://doi.org/10.1145/321406.321409