Properties of Regular Languages CS 351. Proving Languages Not Regular Before we show how languages can be proven not regular, first, how would we show.