Regex Tester & Validator

This regular expression matches the transition rules typically used to define a finite automaton, state machine, or Turing machine. It captures three specific elements: the initial state, the input symbol enclosed in parentheses, and the resulting target state. These components are separated by an arrow (`->`). It is highly useful for building custom parsers for theoretical computer science configurations.