1. Lecture Notes in Computer Science;L Barker,2020
2. Cho, D., Goč, D., Han, Y., Ko, S., Palioudakis, A., Salomaa, K.: State complexity of permutation on finite languages over a binary alphabet. Theor. Comput. Sci. 682, 67–78 (2017)
3. Fleischer, L., Kufleitner, M.: Testing Simon’s congruence. In: 43rd International Symposium on Mathematical Foundations of Computer Science, pp. 62:1–62:13 (2018)
4. Freydenberger, D.D., Gawrychowski, P., Karhumäki, J., Manea, F., Rytter, W.: Testing k-binomial equivalence. Multidisciplinary Creativity: homage to Gheorghe Paun on his 65th birthday, pp. 239–248 (2015)
5. Lecture Notes in Computer Science;E Garel,1993