Elementary Definability of the Class of Universal Planar Automata in the Class of Semigroups


如何引用文章

全文:

开放存取 开放存取
受限制的访问 ##reader.subscriptionAccessGranted##
受限制的访问 订阅存取

详细

Universal planar automata are universal attracting objects in the category of semigroup automata whose set of states and set of output signals are equipped with algebraic structures of the planes that are invariant under the actions of the transition and output functions. We establish the elementary definability of the class of universal planar automata in the class of semigroups and study the problem of the elementary classification of universal planar automata with the use of first-order theories of input signal semigroups of these automata.

作者简介

V. Molchanov

Chernyshevskii Saratov State University

编辑信件的主要联系方式.
Email: v.molchanov@inbox.ru
俄罗斯联邦, Saratov

补充文件

附件文件
动作
1. JATS XML

版权所有 © Pleiades Publishing, Ltd., 2019