Symbolic Logic and Automata

摘要

This paper presents certain languages of symbolic logic for the description of the behavior of finite automata. It describes pre¬cisely the conditions under which a formula of these languages describes the behavior of an automaton, and presents a synthesis algorithm which constructs a state graph for an automaton given a formula that describes the automaton. It closes by listing some unsolved problems about these languages.