SOME SUBSETS OF AUTOMATA OVER A FINITE RING

被引：0
|
作者：
Skobelev, V. G. [1 ]
机构：
[1] Natl Acad Sci Ukraine, Inst Appl Math & Mech, Donetsk, Ukraine
来源：
CYBERNETICS AND SYSTEMS ANALYSIS | 2011年 / 47卷 / 02期
关键词：
finite automaton; finite ring; symmetric stream cipher;
D O I：
10.1007/s10559-011-9302-x
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
Sets of Mealy and Moore automata over an arbitrary finite commutative-associative ring are investigated in which transition and output functions are linear combinations of functions of automaton states and functions of inputs. Subsets of strongly connected, reduced, and reversible automata and automata with permutation transition functions are characterized.
引用
收藏
页码：198 / 201
页数：4
相关论文
共 50 条
12345