ANALYZING THE STRUCTURE OF A CLASS OF LINEAR AUTOMATA OVER A RING Z(p)(k)

被引：0
|
作者：
Skobelev, V. V. [1 ]
机构：
[1] Natl Acad Sci Ukraine, Inst Appl Math & Mech, Donetsk, Ukraine
来源：
CYBERNETICS AND SYSTEMS ANALYSIS | 2008年 / 44卷 / 03期
关键词：
linear automaton; finite ring; state equivalence; parametric identification; initial state identification; fixed point; canonical form;
D O I：
10.1007/s10559-008-9003-2
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
Basic finite-automaton characteristics are established for the class of all linear automata and information-lossless automata over a ring. The complexities of solving problems of parametric identification and initial-state identification are analyzed. The sets of fixed points for mappings realized by initial automata are characterized. Canonical forms are proposed for linear automata over the ring.
引用
收藏
页码：362 / 374
页数：13
相关论文
共 50 条
12345