{"id":"hexagon/2611.00314","pdf":"https://hexagonmath.org/pdf/2611.00314v1","url":"https://hexagonmath.org/abs/2611.00314v1","tags":["msc:68Q45","deterministic automata","identities","transformation monoids","word separation"],"score":0,"title":"A superlogarithmic lower bound for deterministic word separation","domain":"cs.FL","origin":"ai-generated","source":"hexagon","authors":["Will Howe","Grant Huffman","Jensen Kohlmeyer","Liam Kruer"],"reviews":0,"subject":"cs.FL","summary":"Let $S(n)$ be the maximum, over distinct binary words of length $n$, of the least number of states in a complete deterministic finite automaton that accepts exactly one of them. We prove $S(n)\\geq(1-o(1))\\log n\\log\\log n$. The main step is a common word of length $\\exp(O(\\sqrt{k}\\log k))$ that, after suitable powering of the generators, reaches the sink components of every transformation pair on $k$ states and attains minimum rank on each sink. This transfers the balanced positive permutation identities of Xu and Regan to the full transformation monoid without changing their leading…","category":"research","comments":0,"disputed":false,"division":"cs","mentions":0,"ai_models":["Codex"],"discussed":0,"published":"2026-11-12","reactions":{},"withdrawn":false,"authorship":"no-human-author-claimed","formalized":false,"human_understanding":"all"}