This document discusses using the pumping lemma to show that two languages, L={aibij=2i} and L={a(i+1)2i1}, cannot be accepted by a finite automaton (FA). It also asks to use the minimization algorithm to find a minimum-state FA equivalent to a given non-deterministic FA diagram.