A necessary condition on invertibility of finite automata

Tao, Renji; Chen, Shi‐Hua

doi:10.1007/bf02916849

Search citation statements

Order By: Relevance

Paper Sections

Select...

On Generation Of Keys1

Recall Some Definitions a Finite Automaton (Or Sequential M1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

1997

2002

Publication Types

Select...

Article3

Relationship

Self Cite1

Independent2

Authors

Journals

Cited by 3 publications

(2 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…How to generate automata M i and M * i satisfying conditions (a) and (b) in step (1) or (2) [22] gave a solution in the linear case, but this is a difficult problem in the nonlinear case. Fortunately, for the non-linear case, Tao and Chen [23] gave a generation method by R a R b transformation.…”

Section: On Generation Of Keysmentioning

confidence: 98%

See 1 more Smart Citation

A variant of the public key cryptosystem FAPKC3

Tao

Chen

1997

Journal of Network and Computer Applications

Self Cite

View full text Add to dashboard Cite

Section: On Generation Of Keysmentioning

confidence: 98%

“…In his seminal paper [21] D. A. Huffman introduced the concept of -order information lossless that we call weakly invertible with delay [22]. M is said to be weakly invertible with delay (or -order information-lossless) if for any s in S and x i in X, i=0, 1, .…”

Section: Recall Some Definitions a Finite Automaton (Or Sequential Mmentioning

confidence: 99%