Chebotarev A.N.
Problems of synthesis of Σ-automata specified in languages LP and LF of first order logic

For two fragments LP and LF of monadic first-order logic with bounded quantifiers, the corresponding versions of the proposed specification theorem are formulated and proved that allow one to reduce the procedure for synthesizing Σ-automata specified by formulas of these logics to an equivalent transformation of formulas. © 2017, Springer Science+Business Media, LLC.

Keywords: automatic semantics, first-order logic, LF formula, LP formula, specification, specification theorem, Σ-automaton, Automata theory, Formal logic, Semantics, Specifications, Equivalent transformations, First order logic, LF formula, LP formula, Computer circuits

Cite:
Chebotarev A.N. (2017). Problems of synthesis of Σ-automata specified in languages LP and LF of first order logic. Cybernetics and Systems Analysis, 53 (5), 22-33. doi: https://doi.org/10.1007/s10559-017-9969-8 http://jnas.nbuv.gov.ua/article/UJRN-0000754481 [In Russian].