Anfonwch hwn fel neges destun: Lower bounds for unambiguous automata via communication complexity