Skip to main content
SpringerLink
Log in

Constructing finite automata with invertibility by transformation method

  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

R a ,R b transformations were successfully applied to establish invertibility theory for linear and quasi-linear finite automata over finite fields. In a previous paper, the authors generalizedR a ,R b transformations to deal with nonlinear memory finite automata, and gave sufficient conditions for weak inverse and for weakly invertible memory finite automata and inversion processes concerned; methods by transformation to generate a kind of nonlinear memory finite automata satisfying one of these sufficient conditions were also given. This paper extends the concepts, methods and results to general finite automata, in which states consist of finite input history, finite output history and finite “inner state” history.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Tao Jen-chi (Tao Renji). Invertible linear finite automata.Scientica Sinica, 1973, 16: 565–581; Chinese Edition, 1973, 16: 454–467.

    MATH  Google Scholar 

  2. Tao Renji. Invertibility of Finite Automata. Science Press, Beijing, 1979. (in Chinese)

    MATH  Google Scholar 

  3. Chen Shihua. On the structure of inverses of a weakly invertible linear finite automaton.Chinese J. of Computers, 1980, 4: 409–419. (in Chinese)

    Google Scholar 

  4. Chen Shihua, Tao Renji. Invertibility of quasi-linear finite automata.Advances in Cryptology — CHINACRYPT’92, (Science Press, Beijing, 1992), 77–86. (in Chinese)

    Google Scholar 

  5. Tao Renji, Chen Shihua. Generating a kind of nonlinear finite automata with invertibility by transformation method. Technical Report No. ISCAS-LCS-95-05, Laboratory for Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, June 1995.

    Google Scholar 

  6. Tao Renji, Chen Shihua. Two varieties of finite automaton public key cryptosystem and digital signatures.J. of Computer Science and Technology, 1986, 1: 9–18.

    Article  MATH  Google Scholar 

  7. Tao Renji Tao, Chen Shihua, Chen Xuemei. FAPKC3: A new finite automaton public key cryptosystem. Technical Report No. ISCAS-LCS-95-07, Laboratory for Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, June 1995;J. of Computer Science and Technology, 1997, 12: 289–305.

    Article  Google Scholar 

  8. Tao Renji, Chen Shihua. A variant of the public key cryptosystem FAPKC3.J. of Network and Computer Applications, 1997, 20: 283–303.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratory for Computer Science, Institute of Software, Chinese Academy of Sciences, P. O. Box 8718, 100080, Beijing, P. R. China

    Tao Renji & Chen Shihua

Authors
  1. Tao Renji
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chen Shihua
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Tao Renji.

Additional information

Supported by the National Natural Science Foundation of China under grant No. 69773022. An extended abstract of this paper was published in Advances in Cryptology — CHINACRYPT’98, pp. 61–69 Science Press, Beijing, 1998.

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

Reprints and permissions

About this article

Cite this article

Tao, R., Chen, S. Constructing finite automata with invertibility by transformation method. J. Comput. Sci. & Technol. 15, 10–26 (2000). https://doi.org/10.1007/BF02951923

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02951923

Keywords

Search

Navigation