Computer Engineering and Applications ›› 2007, Vol. 43 ›› Issue (2): 49-49.
• 学术探讨 • Previous Articles Next Articles
ZhengWei Xie,PeiMin Deng,Zhong Yi
Received:
Revised:
Online:
Published:
Contact:
谢正卫,邓培民,易忠
通讯作者:
Abstract: This paper studies UIO sequences of linear finite automata ,gets the sufficient and necessary condition for any one state of linear finite automata having UIO sequences with some length .It also gets the sufficient and necessary condition for ( all ) the states of linear finite automata having UIO sequences, gets upper boundary on the minimal length of UIO sequences of the states of linear finite automata which states have UIO sequences . At last,it also gives two algorithms on the existence of UIO sequences of the states of linear finite automata and generating UIO sequences of the state of linear finite automata.
Key words: linear finite automata, UIO sequences, diagnosis matrix, rank, algorithm
摘要: 本文对线性有限自动机的UIO序列进行了讨论, 得到了线性有限自动机的任意一状态有某一长度的UIO序列的充要条件,得到了线性有限自动机的(所有)状态有UIO序列的的充要条件,还给出了有UIO序列的线性有限自动机的状态的最短UIO序列长度的上界,最后给出了判断线性有限自动机的所有状态有无UIO序列以及有求其UIO序列的两个算法.
关键词: 线性有限自动机, UIO 序列, 诊断矩阵, 秩, 算法
ZhengWei Xie,PeiMin Deng,Zhong Yi. UIO SEQUENCES OF LINEAR FINITE AUTOMATA AND ALGORITHMS FOR GENERATING THE SEQUENCES[J]. Computer Engineering and Applications, 2007, 43(2): 49-49.
谢正卫,邓培民,易忠. 线性有限自动机的UIO序列及其生成算法[J]. 计算机工程与应用, 2007, 43(2): 49-49.
0 / Recommend
Add to citation manager EndNote|Ris|BibTeX
URL: http://cea.ceaj.org/EN/
http://cea.ceaj.org/EN/Y2007/V43/I2/49