“If” conditions and state machines are not mutually exclusive. You can implement a proper State machine with “If” conditions.
That switch-case alternative you’re suggesting? That’s just another manifestation of the same concept behind “If” conditions. So, really, with case statements, you’re still implementing nested conditions, just in mixed ways (a mix of case statements and “If” conditions)
The distinguishing characteristic between state machine and bad logic is that the top level conditions are the states, rather than the inputs.
EDIT: for clarity.
Programming is state machines all the way down, it's just the convenience of expression that makes a difference.
More than just convenience of expression, it guards against "impossible states." This article[1] does a good job of explaining it.
[1] https://dev.to/davidkpiano/you-don-t-need-a-library-for-stat...
You know, that kind of code:
Stop and write a proper case statement (aka a state machine). You may discover that combinations of booleans (in my example, stopped & !jumping) deserve to be their own state. The insight is that the resulting code should be one clean case statement, with no nested ifs allowed. Then you know you cover all the states/cases.