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

拟(h,k)存贮有限自动机的可逆性
引用本文:蒙春凤,邓培民,易忠. 拟(h,k)存贮有限自动机的可逆性[J]. 计算机工程与应用, 2009, 45(4). DOI: 10.3778/j.issn.1002-8331.2009.04.017
作者姓名:蒙春凤  邓培民  易忠
作者单位:广西师范大学,数学科学学院,广西,桂林,541004
基金项目:国家自然科学基金,广西自治区自然科学基金,广西省研究生教育创新计划 
摘    要:主要研究拟(h,k)阶存贮有限自动机的延迟k步与k+1步弱可逆性,以及它的弱逆,得到了拟(h,k)阶存贮有限自动机的延迟k步与k+1步弱可逆的充分必要条件,并且通过所得结果可以比较简便地构造出延迟k步与k+1步弱可逆拟(h,k)阶存贮有限自动机的延迟k步与k+1步弱逆.

关 键 词:拟存贮  存贮  有限自动机  弱可逆  弱逆

Invertibility of finite automata with quasi-(h,k)-order memory
MENG Chun-feng,DENG Pei-min,YI Zhong. Invertibility of finite automata with quasi-(h,k)-order memory[J]. Computer Engineering and Applications, 2009, 45(4). DOI: 10.3778/j.issn.1002-8331.2009.04.017
Authors:MENG Chun-feng  DENG Pei-min  YI Zhong
Affiliation:MENG Chun-feng,DENG Pei-min,YI Zhong College of Mathematics,Guangxi Normal University,Guilin,Guangxi 541004,China
Abstract:The weakly revertible and the weakly inverse of finite automata with quasi-(h,k)-order memory with delay k or k+1 are researched in this paper.A sufficient and necessary condition is given that a given finite automata of quasi-(h,k)-order memory is a weakly invertible with delay k or k+1.A weakly inverse of finite automata with quasi-(h,k)-order memory with delay k or k+1 is easily made according to results above.
Keywords:quasi memory  memory  finite automata  weakly invertible  weakly inverse  
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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