점의미형(點意味型) 순서도(順序圖)의 정규표현(正規表現)에 관(關)한 연구(硏究)

On the regular expression of the node-significant sequential graph

The transition diagram, as well as the regular expression, can be used as a formal description for a language acceptable by a finite automaton or for the behavior of a sequential switching circuit. But, if we are given one of these two descriptions, we shall find that it is not easy to get the other counterpart description. This paper is to show an easy method to find the equivalet regular expression from the transition diagram, by the aid of a graph-transformation technique.