4 ms·
Finite state machines will never not be useful for the same reason regular expressions will always be useful. They're a supremely simple model of computation, m
by codemonkey-zeta 5y ago
Finite state machines will never not be useful for the same reason regular expressions will always be useful. They're a supremely simple model of computation, making them easy to reason about.
The problem with state machines in Java is not the state machine's fault, it's Java's fault.
- vikingcaffiene 5y agoI feel like you are refuting a point I didn’t make. I was just talking about how we re-discover patterns. My feelings on Java have nothing to do with it.