Completely Reachable Automata, Primitive Groups and the State Complexity of the Set of Synchronizing Words
From MaRDI portal
Publication:6345307
DOI10.1007/978-3-030-68195-1_24arXiv2007.09104MaRDI QIDQ6345307
Publication date: 17 July 2020
This page was built for publication: Completely Reachable Automata, Primitive Groups and the State Complexity of the Set of Synchronizing Words