# An improvement to a recent upper bound for synchronizing words of finite automata

## TL;DR

This paper improves the upper bound on the length of the shortest reset word in finite automata from approximately 0.1664 to 0.1654, refining the theoretical understanding of automata synchronization.

## Contribution

It introduces a modified approach and a new counting argument that yields a tighter upper bound on reset word length.

## Key findings

- Upper bound improved to 0.1654
- New counting argument developed
- Refinement of previous theoretical bounds

## Abstract

It has been known since the 60's that any complete discrete $n$-state automaton admits a reset word of length not exceeding $\alpha n^3+o(n^3)$ for some absolute constant $\alpha$. J.-E. Pin and P. Frankl proved this statement with $\alpha=1/6=0.1666...$ in 1982, and this bound remained best known until 2017, when M. Szyku\l{}a decreased its value to $\alpha\approx0.1664$. In this note, we present a modification to the latest approach and develop a different counting argument which leads to a more substantial improvement of $\alpha\leqslant 0.1654$.