Abstract. This paper presents methods for synthesizing ∑-automata from specifications in the language LP with deterministic semantics and in the language LF with nondeterministic semantics. These methods are based on the equivalent transformation of the formula of the form into a so called normal form whose structure corresponds to the state transition graph of a specified automaton.
Keywords: ∑-automaton, LP-formula, LF-formula, automatic semantics, normal form, orthogonalization.
1 V. M. Glushkov Institute of Cybernetics, National Academy of Sciences of Ukraine, Kyiv, Ukraine,
e-mail: ancheb@gmail.com.