Judge-level effects and judge-specific slopes explain 61% of variance in H1 Connect research quality ratings versus 7% for papers and journals combined.
State Complexity of the Set of Synchronizing Words for Circular Automata and Automata over Binary Alphabets
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
Most slowly synchronizing automata over binary alphabets are circular, i.e., containing a letter permuting the states in a single cycle, and their set of synchronizing words has maximal state complexity, which also implies complete reachability.Here, we take a closer look at generalized circular and completely reachable automata. We derive that over a binary alphabet every completely reachable automaton must be circular, a consequence of a structural result stating that completely reachable automata over strictly less letters than states always contain permutational letters. We state sufficient conditions for the state complexity of the set of synchronizing words of a generalized circular automaton to be maximal. We apply our main criteria to the family $\mathscr K_n$ of automata that was previously only conjectured to have this property.
fields
cs.DL 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Judges matter more than papers in post-publication research assessment
Judge-level effects and judge-specific slopes explain 61% of variance in H1 Connect research quality ratings versus 7% for papers and journals combined.