Pošalji tekstualnu poruku: Lower bounds for unambiguous automata via communication complexity