發送短信: Lower bounds for unambiguous automata via communication complexity