We investigate the relationship between regular languages and syntactic monoid size. In particular, we consider the transformation monoids of n-state (minimal) deterministic finite automata. We show tight upper bounds on the syntactic monoid size, proving that an nstate deterministic finite automaton with singleton input alphabet (input alphabet with at least three letters, respectively) induce...