Structure of weakly invertible semi-input-memory finite automata with delay 2

被引:0
|
作者
Renji Tao
Shihua Chen
机构
[1] The Chinese Academy of Sciences,Key Laboratory of Computer Science, Institute of Software
关键词
finite automata; semi-input-memory; invertibility;
D O I
暂无
中图分类号
学科分类号
摘要
Semi-input-memory finite automata, a kind of finite automata introduced by the author of this paper for studying error propagation, are a generalization of input-memory finite automata by appending an autonomous finite automaton component. This paper gives a characterization on the structure of weakly invertible semi-input-memory finite automata with delay 2 in which input alphabets and output alphabets have two elements and autonomous finite automata are cyclic. For the structure of feedforward inverse finite automata with delay 2, Zhu first gave a characterization; from a result on mutual invertibility of finite automata, the result mentioned above also leads to a different characterization on the structure of feedforward inverse finite automata with delay 2.
引用
收藏
页码:682 / 688
页数:6
相关论文
共 19 条