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


Decomposing a kind of weakly invertible finite automata with delay 2
Authors:Gang?Yao  author-information"  >  author-information__contact u-icon-before"  >  mailto:yaogcrab@ios.ac.cn"   title="  yaogcrab@ios.ac.cn"   itemprop="  email"   data-track="  click"   data-track-action="  Email author"   data-track-label="  "  >Email author
Affiliation:(1) Laboratory of Computer Science, Institute of Software, The Chinese Academy of Sciences, 100080 Beijing, P.R. China;(2) Graduate School of the Chinese Academy of Sciences, 100039 Beijing, P.R. China
Abstract: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.
Keywords:finite automaton   weakly invertible   delay   composition   decomposition
本文献已被 CNKI 维普 万方数据 SpringerLink 等数据库收录!
点击此处可从《计算机科学技术学报》浏览原始摘要信息
点击此处可从《计算机科学技术学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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