Analyzing the structure of a class of linear automata over a ring \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$ Z_{p^k } $$\end{document}

被引:0
|
作者
V. V. Skobelev
机构
[1] National Academy of Sciences of Ukraine,Institute of Applied Mathematics and Mechanics
关键词
linear automaton; finite ring; state equivalence; parametric identification; initial state identification; fixed point; canonical form;
D O I
10.1007/s10559-008-9003-2
中图分类号
学科分类号
摘要
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
页数:12
相关论文
共 50 条