Classification and Enumeration of Matched Free Response Matrices of Linear Finite Automata

被引：0
|
作者：
Dai Zongduo Ye Dingfeng Zhai Qibin Ou Haiwen (Graduate School of Academia Sinica
机构：
来源：
Acta Mathematica Sinica,English Series | 1997年 / 01期
关键词：
Finite automation; Free response matrix; Classification; Enumeration;
D O I：
暂无
中图分类号：
O151.21 [矩阵论];
学科分类号：
070104 ;
摘要：
If H and G are the transfer function matrix and the free response matrix of a linearfinite automaton,then G is called a free response matrix matched to H.Given H,let(H)be theset of all possible free response matrices matched to H.A classification and an enumeration on theset(H)are given in this paper.
引用
收藏
页码：133 / 144
页数：12
相关论文
共 50 条
12345