This task can be achieved by a finite automaton with just two states and a “program” consisting of four statements called transition rules.
This task can be achieved by a finite automaton with just two states and a “program” consisting of four statements called transition rules.
有限自动机在执行这项工作时，只需要两个状态和一套含四则转换规则的程序。