On the complexity of Simon automata over the Dyck language