Since we have shown the equivalence of regular languages and FSAs, we can prove facts about language membership by describing constructions on their corresponding automata. Also, we show that it is possible to prove facts other than language membership using a FSA.