Advertisement

Journal of Computer Science and Technology

, Volume 17, Issue 6, pp 682–688 | Cite as

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

  • Tao Renji 
  • Chen Shihua 
Regular Papers
  • 27 Downloads

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.

Keywords

finite automata semi-input-memory invertibility 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    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.MATHMathSciNetGoogle Scholar
  2. [2]
    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.MATHGoogle Scholar
  3. [3]
    Zhu X. On the structure of binary feedforward inverses with delay 2.J. Computer Science and Technology, 1989, 4(2): 163–171.MATHCrossRefGoogle Scholar
  4. [4]
    Bao F. On the structure ofn-ary feedforward inverses with delay 1 [Thesis]. Institute of Software, Chinese Academy of Sciences, 1986. (in Chinese)Google Scholar
  5. [5]
    Tao R, Chen S. Input-trees of finite automata and application to cryptanalysis.J. Computer Science and Technology, 2000, 15(4): 305–325.MATHCrossRefMathSciNetGoogle Scholar
  6. [6]
    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.MATHCrossRefMathSciNetGoogle Scholar
  7. [7]
    Tao R.Invertibility of Finite Automata. Science Press, Beijing, 1979. (in Chinese)MATHGoogle Scholar

Copyright information

© Science Press, Beijing China and Allerton Press Inc. 2002

Authors and Affiliations

  1. 1.Key Laboratory of Computer Science, Institute of SoftwareThe Chinese Academy of SciencesBeijingP.R. China

Personalised recommendations