Stefan Hoffmann. Completely Reachable Automata, Primitive Groups and the State Complexity of the Set of Synchronizing Words. In Alberto Leporati, Carlos Martín-Vide, Dana Shapira, Claudio Zandron, editors, Language and Automata Theory and Applications - 15th International Conference, LATA 2021, Milan, Italy, March 1-5, 2021, Proceedings. Volume 12638 of Lecture Notes in Computer Science, pages 305-317, Springer, 2021. [doi]
@inproceedings{Hoffmann21-0, title = {Completely Reachable Automata, Primitive Groups and the State Complexity of the Set of Synchronizing Words}, author = {Stefan Hoffmann}, year = {2021}, doi = {10.1007/978-3-030-68195-1_24}, url = {https://doi.org/10.1007/978-3-030-68195-1_24}, researchr = {https://researchr.org/publication/Hoffmann21-0}, cites = {0}, citedby = {0}, pages = {305-317}, booktitle = {Language and Automata Theory and Applications - 15th International Conference, LATA 2021, Milan, Italy, March 1-5, 2021, Proceedings}, editor = {Alberto Leporati and Carlos Martín-Vide and Dana Shapira and Claudio Zandron}, volume = {12638}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {978-3-030-68195-1}, }