1. Check if two regular grammars with the following sets of productions: (1) S aA, A bB, A aC, A , B aA, B bB, C aC, C (2) S aA, S aB, A bA, A bS, B aB, B are equivalent (i.e., if they generate the same languages) by finding equivalent minimal deterministic automata and checking if they are isomorphic, i.e., is they are the same except of state names.