One thing that bugs me is this: The following are formally defined mathematical structures: - Moore Machine - Mealy Machine - Deterministic Finite Autom

One thing that bugs me is this: The following are formally defined mathematical structures: - Moore Machine - Mealy Machine - Deterministic Finite Automata There are also (multiple) formal semantics for Harel State Charts. But there is no single precise formal definition of what a coroutine is. And when we talk about programming with (finite) state machines, we are often not strictly referring to any of the above formalisms. To claim that two ill-defined notions are equivalent is not particularly meaningful.