On the study of n-ary directed graph

• Main Authors: Ben Wu Chang, 張本五
• Other Authors: Yi Shiung Yeh
• Format: Others
• Language: en_US
• Published: 1994
• Online Access: http://ndltd.ncl.edu.tw/handle/43366547365316041303

碩士 === 國立交通大學 === 資訊工程研究所 === 82 === In this thesis, we describe a cryptosystem based on n-ary directed graphs. In order to implement this cryptosystem, we discuss some properties of an n-ary directed graph. First of all, we discuss the minimization of an n-ary directed graph which is very similar to a finite state machine, so we refer a way to minimize a finite state machine while minimizing an n- ary directed graph. A special n-ary directed graph, an isolated n-ary directed graph, is also discussed. Finally, we describe the tabular representation of an n-ary directed graph. It is a simple way to represent an n-ary directed graph. We describe some special cases of tabular representation in the final section of this thesis.