Finite automaton recognizing


#1

Construct a finite automaton recognizing L(G), where G is the grammar S->aS/bA/b and A->aA/bS/a


#2