Apply the general algorithm for transforming the finite automaton into a regular language (i.e., a language described by a regular expression) to Automaton B. For simplicity, assume that we only have symbols 0, 1, and a. Eliminate first the error state, then the start state, and finally, the state c.

(ns)