Introduction - If you have any usage issues, please Google them yourself
Use poor to determine the automaton M = (K, sigma, F, S, Z) behavior simulation program algorithm, for any given string belongs to the language, the process is calculated by the finite number of times will stop and answer " Yes" , if it does not belong to either stop and answer is " No"