J. Berstel, D. Perrin, and C. Reutenauer, Codes and Automata (Encyclopedia of Mathematics and Its Applications), 2009.

J. Brzozowski and B. Li, Syntactic complexity of R-and J-trivial regular languages, International Journal of Foundations of Computer Science, vol.25, issue.07, pp.807-821, 2014.

J. Brzozowski, B. Li, and D. Liu, Syntactic complexities of six classes of star-free languages, J. Autom. Lang. Comb, vol.17, issue.2, pp.83-105, 2012.

J. Brzozowski, B. Li, and Y. Ye, Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages, descriptional Complexity of Formal Systems, vol.449, pp.37-53, 2011.

J. Brzozowski and Y. Ye, Syntactic complexity of ideal and closed languages, Developments in Language Theory, pp.117-128

H. Springer-berlin, , 2011.

J. A. Brzozowski, M. Szyku-la, and Y. Ye, Syntactic complexity of regular ideals. Theory of, Computing Systems, vol.62, issue.5, pp.1175-1202, 2018.

M. Holzer and B. König, On deterministic finite automata and syntactic monoid size, Theoretical Computer Science, vol.327, issue.3, pp.319-347, 2004.

J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages and Computation, 1979.

A. N. Maslov, Estimates of the number of states of finite automata, Dokl. Akad. Nauk SSSR, vol.194, pp.1266-1268, 1970.

S. N. Singh, Semi-Flower Automata, 2012.

S. N. Singh and K. V. Krishna, The holonomy decomposition of some circular semiflower automata, Acta Cybernetica, vol.22, issue.4, pp.81-95, 2016.

S. N. Singh and K. V. Krishna, On syntactic complexity of circular semi-flower automata, pp.312-323, 2018.

M. Szyku-la and J. Wittnebel, Syntactic complexity of bifixfree regular languages, Theoretical Computer Science, 2019.

,