1. Lecture Notes in Computer Science;J Brzozowski,2016
2. Brzozowski, J.A., Simon, I.: Characterizations of locally testable events. Discret. Math. 4(3), 243–271 (1973)
3. Lecture Notes in Computer Science;RH Campbell,1974
4. Câmpeanu, C., Salomaa, K., Yu, S.: Tight lower bound for the state complexity of shuffle of regular languages. J. Autom. Lang. Comb. 7(3), 303–310 (2002)
5. Diekert, V., Rozenberg, G. (eds.): The Book of Traces. World Scientific, River Edge (1995)