Introduction - If you have any usage issues, please Google them yourself
Simple DFA finite automata may be based on the input state transition table for state transitions, the input string to determine that the automatic machine is acceptable. And have specific reporting instructions.