Decomposing a Kind of Weakly Invertible Finite Automata with Delay 2
Decomposing a kind of weakly invertible finite automata with delay 2作者机构:LaboratoryofComputerScienceInstituteofSoftwareTheChineseAcademyofSciencesBeijing100080P.R.China
出 版 物:《Journal of Computer Science & Technology》 (计算机科学技术学报(英文版))
年 卷 期:2003年第18卷第3期
页 面:354-360页
核心收录:
学科分类:08[工学] 081202[工学-计算机软件与理论] 0812[工学-计算机科学与技术(可授工学、理学学位)]
基 金:国家自然科学基金
主 题:finite automaton weakly invertible delay composition decomposition
摘 要:Some properties of a finite automaton composed of two weakly invertible finite automata with delay 1 are given, where each of those two automata has the output set of each state with the same size. And for a weakly invertible finite automaton M with delay 2 satisfying the properties mentioned in this paper, two weakly invertible finite automata with delay 1 are constructed such that M is equivalent to a sub-finite-automaton of the composition of those two. So a method to decompose this a kind of weakly invertible finite automata with delay 2 is presented.