Converting a Finite Automaton to a Regular Expression (State Elimination / GNFA)

Rip out states one by one, rerouting their paths into edge labels, until only start and accept remain; what's left on that edge is the regular expression — Arden's rule does the same job algebraically.