@article{oai:fukuyama-u.repo.nii.ac.jp:00008153,
 author = {渡辺, 浩司 and 猪飼, 武夫 and 福永, 邦雄},
 journal = {福山大学工学部紀要},
 month = {Dec},
 note = {P(論文), Regarding finite automata (FAs) as discrete time dynamical systems, they can be represented as state space models over B(={0,1}) similar to the representation method of linear systems over the real numbers (R) in the field of dynamical systems and controls. Based on this representation, we first propose a minimal realization method for deterministic FAs using Ho-Kalman's algorithm which is well-known method in the field of dynamical systems and controls. Since state space models of FAs are bilinear over B, and Ho-Kalman's algorithm is, on the other hand, one for linear system over R, we add some extensions to their algorithm. We next extend state space models of FAs to those over R, and call them real finite. automata. We then apply Ho-Kalman's algorithm to them.},
 pages = {233--238},
 title = {Ho-Kalmanアルゴリズムを用いた実数有限オートマトンの最小実現},
 volume = {27},
 year = {2003}
}