List of Results on the Černý Conjecture and Reset Thresholds for Synchronizing Automata
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866918285167034368 |
|---|---|
| author | Volkov, Mikhail V. |
| author_facet | Volkov, Mikhail V. |
| contents | We survey results in the literature that establish the Černý conjecture for various classes of finite automata. We also list classes for which the conjecture remains open, but a quadratic (in the number of states) upper bound on the minimum length of reset words is known. The results presented reflect the state of the art as of January 13, 2026. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_15655 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | List of Results on the Černý Conjecture and Reset Thresholds for Synchronizing Automata Volkov, Mikhail V. Formal Languages and Automata Theory 68Q45 F.1.1 We survey results in the literature that establish the Černý conjecture for various classes of finite automata. We also list classes for which the conjecture remains open, but a quadratic (in the number of states) upper bound on the minimum length of reset words is known. The results presented reflect the state of the art as of January 13, 2026. |
| title | List of Results on the Černý Conjecture and Reset Thresholds for Synchronizing Automata |
| topic | Formal Languages and Automata Theory 68Q45 F.1.1 |
| url | https://arxiv.org/abs/2508.15655 |