Counterargument: coroutines are Turing-complete, FSM’s are not, equivalence is two-way.
Moreover, the “co” isn’t doing any work, because you can write FSMs in languages that don’t have coprocessing.
Counterargument: coroutines are Turing-complete, FSM’s are not, equivalence is two-way.
Moreover, the “co” isn’t doing any work, because you can write FSMs in languages that don’t have coprocessing.