Publisher
Springer International Publishing
Reference11 articles.
1. Bondar, E.A., Casas, D., Volkov, M.V.: Completely reachable automata: an interplay between automata, graphs, and trees. CoRR abs/2201.05075 (2022). https://arxiv.org/abs/2201.05075
2. Lecture Notes in Computer Science;EA Bondar,2016
3. Lecture Notes in Computer Science;EA Bondar,2018
4. Don, H.: The Černý conjecture and 1-contracting automata. Electr. J. Comb. 23(3), 3–12 (2016). https://doi.org/10.37236/5616
5. Dubuc, L.: Sur les automates circulaires et la conjecture de Černý. RAIRO Inform. Théorique App. 32, 21–34 (1998). in French. http://www.numdam.org/item/ITA_1998__32_1-3_21_0
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献