%0 Journal Article
%T Structure of Weakly Invertible Semi-Input-Memory Finite Automata with Delay 2
%A Tao Renji
%A and Chen Shihua
%A <br>陶仁骥
%A 陈世华
%J 计算机科学技术学报
%D 2002
%I 
%X 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.
%K finite automata
%K semi-input-memory
%K invertibility<br>半输入存储
%K 保密系统自然模型
%K 有限自动化
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=F57FEF5FAEE544283F43708D560ABF1B&aid=E4863048A3F7B9BA9F37DC0881FE0F8E&yid=C3ACC247184A22C1&vid=BCA2697F357F2001&iid=B31275AF3241DB2D&sid=2B25C5E62F83A049&eid=2B25C5E62F83A049&journal_id=1000-9000&journal_name=计算机科学技术学报&referenced_num=1&reference_num=9