1. Lecture Notes in Computer Science;EA Bondar,2016
2. Lecture Notes in Computer Science;F Gonze,2017
3. Gonze, F., Jungers, R.M.: On completely reachable automata and subset reachability. In: Hoshi, M., Seki, S. (eds.): DLT 2018, LNCS 11088, pp. 330–341 (2018). https://doi.org/10.1007/978-3-319-98654-8_z
4. Don, H.: The Černý conjecture and 1-contracting automata. Electr. J. Comb. 23(3), P3.12 (2016)
5. Maslennikova, M.I.: Reset complexity of ideal languages. In: Bieliková, M., Friedrich, G., Gottlob, G., Katzenbeisser, S., Špánek, R., Turán, G. (eds.) 38th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2012, vol. II, pp. 33–44. Institute of Computer Science Academy of Sciences of the Czech Republic, Prague (2012)