Publisher
Springer Nature Switzerland
Reference10 articles.
1. Lecture Notes in Computer Science;EA Bondar,2016
2. LNCS;D Casas,2022
3. Casas, D., Volkov, M.V.: Don’s conjecture for binary completely reachable automata: an approach and its limitations (2023). https://arxiv.org/abs/2311.00077
4. Don, H.: The Černý conjecture and 1-contracting automata. Electron. J. Combin. 23(3), Paper 3.12, 10 (2016). https://doi.org/10.37236/5616
5. Ferens, R., Szykuła, M.: Completely reachable automata: a polynomial algorithm and quadratic upper bounds. In: Etessami, K., Feige, U., Puppis, G. (eds.) 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023). Leibniz International Proceedings in Informatics (LIPIcs), vol. 261, pp. 59:1–59:17. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany (2023). https://doi.org/10.4230/LIPIcs.ICALP.2023.59