FSM Parser Theory. A friendly conversation with Claude Opus





Q: automata theory have a class hierarchy, starting from combinational logic. right?

Yes, that's a clean way to frame it. The hierarchy goes from "no memory" to "more memory":


Combinational logic — output depends only on current input. No memory, no state. Just pure boolean...