Study of Communication Network Using Unilateral Graph and Grammar

摘要

A unilateral graph representation is used for representing a network with a minimum of 3 nodes. A nearly closed network is identified from the various possible combinations of the formed network, with respect to the direction of communication. The possible number of bypass nodes are identified from the combination and tabulated. The same representation was carried out with the network having 4 nodes. A common word combination was observed in both the cases which can be extended to any number of nodes. Network at each level has been studied through finite state automaton along with its regular grammar.