1. Backhouse, R.C., Closure algorithms and the star height problem of regular languages. Ph.D. thesis, Imperial College (1974).
2. On decompositions of regular events;Brzozowski;JACM,1969
3. Classification of noncounting events;Brzozowski;J. Comput. Syst. Sci.,1971
4. The dot-depth hierarchy of star-free languages is infinite;Brzozowski;J. Comput. Syst. Sci.,1978