首页 | 本学科首页   官方微博 | 高级检索  
     

线性有限自动机的UIO序列及其生成算法
引用本文:谢正卫,邓培民,易忠. 线性有限自动机的UIO序列及其生成算法[J]. 计算机工程与应用, 2007, 43(2): 49-52,144
作者姓名:谢正卫  邓培民  易忠
作者单位:江苏技术师范学院,基础课部,江苏,常州,213001;广西师范大学,数学科学学院,广西,桂林,541004;江苏技术师范学院,基础课部,江苏,常州,213001
基金项目:国家自然科学基金 , 教育部优秀青年教师资助计划 , 广西自然科学基金
摘    要:对线性有限自动机的UIO序列进行了讨论,得到了线性有限自动机的任意一状态有某一长度的UIO序列的充要条件,得到了线性有限自动机的(所有)状态有UIO序列的的充要条件,还给出了有UIO序列的线性有限自动机的状态的最短UIO序列长度的上界,最后给出了判断线性有限自动机的所有状态有无UIO序列以及有求其UIO序列的两个算法.

关 键 词:线性有限自动机  UIO序列  诊断矩阵    算法
文章编号:1002-8331(2007)02-0049-04
修稿时间:2006-08-01

UIO sequences of linear finite automata and algorithms for fenerating the sequences
XIE Zheng-wei,DENG Pei-min,YI Zhong. UIO sequences of linear finite automata and algorithms for fenerating the sequences[J]. Computer Engineering and Applications, 2007, 43(2): 49-52,144
Authors:XIE Zheng-wei  DENG Pei-min  YI Zhong
Affiliation:1.Department of Basic Courses,Jiangsu Teachers University of Technology,Changzhou,Jiangsu 213001 ,China; 2.College of Mathmatic and Science,Guangxi Normal University,Guilin,Guangxi 541004,China
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.
Keywords:linear finite automata    UIO sequences   diagnosis matrix   rank    algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号