Regex Tester & Validator

Matches finite automaton transition rules, capturing the source state name, the input symbol, and the target state. The pattern expects a state identifier followed by a single-character input in parentheses, then an arrow and the resulting state. Useful for parsing state machine definitions or formal automata descriptions in text format.