Title :
Study of Communication Network Using Unilateral Graph and Grammar
Author :
Thiagarajan, K. ; Jeyabharathi, S. ; Natarajan, Ponnammal
Author_Institution :
Dept. of Math., Velammal Coll. of Eng. & Tech, Madurai, India
Abstract :
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.
Keywords :
finite automata; graph grammars; graph theory; bypass nodes; communication network; finite state automaton; graph grammar; unilateral graph representation; Automata; Communication networks; Educational institutions; Grammar; Logic gates; Mesh networks; Servers; automaton; bypass nodes; closed network; grammar; nearly closed network; node;
Conference_Titel :
Bio-Inspired Computing: Theories and Applications (BIC-TA), 2011 Sixth International Conference on
Conference_Location :
Penang
Print_ISBN :
978-1-4577-1092-6
DOI :
10.1109/BIC-TA.2011.9
