Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Tao R. Relationship between bounded error propagation and feedforward invertibility.Kexue Tongbao, 1982, 27 (6): 680–682;Kexue Tongbao (Chinese Edition), 1982, 27(7): 406–408.
Tao R. Some results on the structure of feedforward inverses.Scientia Sinica, Ser. A, 1984, 27(2): 157–162;Scientia Sinica (Chinese Edition), Ser. A, 1983, (12): 1073–1078.
Zhu X. On the structure of binary feedforward inverses with delay 2.J. Computer Science and Technology, 1989, 4(2): 163–171.
Bao F. On the structure ofn-ary feedforward inverses with delay 1 [Thesis]. Institute of Software, Chinese Academy of Sciences, 1986. (in Chinese)
Tao R, Chen S. Input-trees of finite automata and application to cryptanalysis.J. Computer Science and Technology, 2000, 15(4): 305–325.
Tao R, Chen S. Structure of weakly invertible semi-input-memory finite automata with delay 1.J. Computer Science and Technology, 2002, 17(4): 369–376.
Tao R.Invertibility of Finite Automata. Science Press, Beijing, 1979. (in Chinese)
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported by the National Natural Science Foundation of China under Grant No.60C73021 and the NKBRSF of China under Grant No.G19990358.
TAO Renji graduated from Department of Mathematics, Peking University in 1957. He is now a professor of the Institute of Software, Chinese Academy of Sciences. His current research interests are automata theory, cryptology and combinatorics.
CHEN Shihua graduated from Department of Mathematics, Sichuan University in 1959. She is now a professor of the Institute of Software, Chinese Academy of Sciences. Her current research interests are automata theory, cryptology and combinatorics.
Rights and permissions
About this article
Cite this article
Tao, R., Chen, S. Structure of weakly invertible semi-input-memory finite automata with delay 2. J. Compt. Sci. & Technol. 17, 682–688 (2002). https://doi.org/10.1007/BF02960758
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02960758