To show equivalence, you should show that any state machine can be implemented as a coroutine and vice versa. The author here implements one example with corout

To show equivalence, you should show that any state machine can be implemented as a coroutine and vice versa. The author here implements one example with coroutines and with a state machine, which shows exactly nothing. (As a metaphore, it's like saying that being green and being a frog is equivalent, because there exists a green frog)