Conditions of A-completeness for linear automata over dyadic rationals

IF 0.3 Q4 MATHEMATICS, APPLIED

Discrete Mathematics and Applications Pub Date : 2021-06-01 DOI:10.1515/dma-2021-0016

Dmitriy V. Ronzhin

引用次数: 0

Abstract

Abstract We consider the problem of A-completeness in the class of linear automata such that the sets of inputs, outputs and states are Cartesian products of dyadic rationals; systems checked for completeness are comprised of a variable finite set and a fixed additional set. We obtain conditions of A-completeness in terms of maximal subclasses in the cases when the additional set is the set of all unary automata and when the additional set consists of the adder.

查看原文本刊更多论文

并矢有理上线性自动机的a -完备性条件

摘要我们考虑了一类线性自动机的A-完备性问题，使得输入、输出和状态的集合是二元理性的笛卡尔乘积；完整性检验系统由一个可变有限集和一个固定附加集组成。当附加集是所有一元自动机的集合时，以及当附加集由加法器组成时，我们得到了关于最大子类的A-完备条件。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Discrete Mathematics and Applications MATHEMATICS, APPLIED-

CiteScore

0.60

自引率

20.00%

发文量

期刊介绍： The aim of this journal is to provide the latest information on the development of discrete mathematics in the former USSR to a world-wide readership. The journal will contain papers from the Russian-language journal Diskretnaya Matematika, the only journal of the Russian Academy of Sciences devoted to this field of mathematics. Discrete Mathematics and Applications will cover various subjects in the fields such as combinatorial analysis, graph theory, functional systems theory, cryptology, coding, probabilistic problems of discrete mathematics, algorithms and their complexity, combinatorial and computational problems of number theory and of algebra.