deterministic finite state machine造句

• It is possible to write an algorithm that, for two given regular expressions, decides whether the described languages are equal; the algorithm reduces each expression to a minimal deterministic finite state machine, and determines whether they are isomorphic ( equivalent ).
• As should be readily apparent, if the initial state is the pure state | S _ 1 \ rangle or | S _ 2 \ rangle, then the result of running the machine will be exactly identical to the classical deterministic finite state machine.